A parametric active-set method for qps with vanishing constraints arising in a robot motion planning problem
zbMATH Open1270.90042MaRDI QIDQ4921907FDOQ4921907
Christian Kirches, Sebastian Sager, A. Potschka, Hans Georg Bock
Publication date: 28 May 2013
Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol9/p275.html
Recommendations
- A study of one-parameter regularization methods for mathematical programs with vanishing constraints
- An SQP method for mathematical programs with vanishing constraints with strong convergence properties
- Active-set Newton methods for mathematical programs with vanishing constraints
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
active set methodsparametric quadratic programmingmathematical programs with vanishing constraintsrobot motion planning
Quadratic programming (90C20) Methods of successive quadratic programming type (90C55) Nonconvex programming, global optimization (90C26)
Cited In (13)
- Some non-smooth optimality results for optimization problems with vanishing constraints via Dini-Hadamard derivative
- Robust mathematical programming problems involving vanishing constraints via strongly invex functions
- Mathematical programs with vanishing constraints involving strongly invex functions
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Computational approaches for mixed integer optimal control problems with indicator constraints
- On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints
- On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints
- Finite convergence of an active signature method to local minima of piecewise linear functions
- Optimality results for nondifferentiable vector optimization problems with vanishing constraints
- On a relaxation method for mathematical programs with vanishing constraints
- New dualities for mathematical programs with vanishing constraints
- Numerical solution of optimal control problems with explicit and implicit switches
- On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints
This page was built for publication: A parametric active-set method for qps with vanishing constraints arising in a robot motion planning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4921907)
