Add to ORKGAn algorithm for convex parametric QPs is studied. The algorithm explores the parameter space by stepping a sufficiently small distance over the facets of each critical region and thereby identifying the neighboring regions. Some conjectures concerning this algorithm and the structure of the solution of a parametric QP are presented
This note brings together two fundamental topics: polyhedral projection and parametric linear progra...
Multiparametric (mp) programming pre-computes optimal solutions offline which are functions of param...
We consider a family of generalized Procrustes problems. In this class of problems, one aims at alig...
In some of the recently developed algorithms for convex parametric quadratic programs it is implicit...
In this paper we derive formulas for computing graphical derivatives of the (possibly multivalued) s...
In this thesis we consider four problems arising from our study of quadratically constrained convex ...
International audience—Several optimization-based control design techniques can be cast in the form ...
Several optimization-based control design techniques can be cast in the form of parametric optimizat...
We consider the convex parametric quadratic programming problem when the end of the parametric inter...
We consider the convex parametric quadratic programming problem when the end of the parametric inter...
We consider a parametric convex quadratic programming, CQP, relaxation for the quadratic knapsack pr...
At the intersection of combinatorial and nonlinear optimization, quadratic programming (QP) plays an...
The parametric minimax problem, which finds the parameter value minimizing the weight of a solution ...
Convex programming has been a research topic for a long time, both theoretically and algorithmically...
The aim of this paper is to show how a wide class of generalized quadratic programs can be solved, i...
This note brings together two fundamental topics: polyhedral projection and parametric linear progra...
Multiparametric (mp) programming pre-computes optimal solutions offline which are functions of param...
We consider a family of generalized Procrustes problems. In this class of problems, one aims at alig...
In some of the recently developed algorithms for convex parametric quadratic programs it is implicit...
In this paper we derive formulas for computing graphical derivatives of the (possibly multivalued) s...
In this thesis we consider four problems arising from our study of quadratically constrained convex ...
International audience—Several optimization-based control design techniques can be cast in the form ...
Several optimization-based control design techniques can be cast in the form of parametric optimizat...
We consider the convex parametric quadratic programming problem when the end of the parametric inter...
We consider the convex parametric quadratic programming problem when the end of the parametric inter...
We consider a parametric convex quadratic programming, CQP, relaxation for the quadratic knapsack pr...
At the intersection of combinatorial and nonlinear optimization, quadratic programming (QP) plays an...
The parametric minimax problem, which finds the parameter value minimizing the weight of a solution ...
Convex programming has been a research topic for a long time, both theoretically and algorithmically...
The aim of this paper is to show how a wide class of generalized quadratic programs can be solved, i...
This note brings together two fundamental topics: polyhedral projection and parametric linear progra...
Multiparametric (mp) programming pre-computes optimal solutions offline which are functions of param...
We consider a family of generalized Procrustes problems. In this class of problems, one aims at alig...