• No results found

Poster Session II

N/A
N/A
Protected

Academic year: 2021

Share "Poster Session II"

Copied!
1
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Poster Session II

Nonlinear loudspeaker compensation through embedded convex

optimization

Bruno Defraene, Toon van Waterschoot, Moritz Diehl and Marc Moonen (KUL) Abstract

In this poster, a novel nonlinear loudspeaker compensation technique is presented which is based on embedded convex optimization. The aim is to compensate for the linear as well as for the nonlinear perceptible distortions incurred in the loudspeaker. To this end, a psychoacoustic model is adopted and a convex optimization based problem formulation is set up. In order to solve the resulting convex optimization problems in a fast and reliable way, a projected gradient optimization method is proposed. From comparative objective evaluation experiments, it is concluded that the proposed nonlinear loudspeaker compensation technique indeed improves the average audio quality scores.

******

Time-Optimal Path Following for Robots with Convex-Concave

Constraints using Sequential Convex Programming

Frederik Debrouwere, Wannes Van Loock, Goele Pipeleers, Tran Dinh Quoc, Moritz Diehl, Joris De Schutter and Jan Swevers (KUL)

Abstract

Time-optimal path following considers the problem of moving along a predetermined geometric path in minimum time. In the case of a robotic manipulator with simplified constraints a convex reformulation of this optimal control problem has been derived previ-ously. However, many applications in robotics feature non-convex constraints. We propose an efficient sequential convex programming (SCP) approach to solve the corresponding non-convex optimal control problems by writing the non-convex constraints as a di↵erence of convex (DC) functions, resulting in convex-concave constraints.

******

Referenties

GERELATEERDE DOCUMENTEN

First, we consider how to construct piecewise linear upper and lower bounds to approximate the output for the multivariate case.. This extends the method in Siem

Theorem ( 4-P6) (dual necessary condition for optimality): Suppose the primal and the dual free starting point problem both possess a regular solution (viz.. Moreover, for

Valkruid krijgt nu een Oranje Stip en geen Groene Stip meer doordat de opnamen met vochtige heischrale graslanden niet meer zijn toegekend aan dit – droge – ecosysteemtype, maar

The solution results from solving a quadratic programming problem which can be accelerated by using dedicated decomposition methods (as SMO, [11]), sometimes all solutions

This paper proposes a much tighter relaxation, and gives an application to the elementary task of setting the regularization constant in Least Squares Support Vector Machines

Here, we confine ourselves to a summary of some key concepts: the regularization constant plays a crucial role in Tikhonov regularization [19], ridge regression [9], smoothing

This paper advances results in model selection by relaxing the task of optimally tun- ing the regularization parameter in a number of algorithms with respect to the

It is the purpose of this paper to formulate a non-parallel semi-supervised algorithm based on kernel spectral clustering for which we can directly apply the kernel trick and thus