Cited in
(30)- Convergence criteria for hierarchical overlapping coordination of linearly constrained convex design problems
- A minima tracking variant of semi-infinite programming for the treatment of path constraints within direct solution of optimal control problems
- PAL-Hom method for QP and an application to LP
- Recent advances in quadratic programming algorithms for nonlinear model predictive control
- A quadratic approximation for protein sequence to structure mapping.
- Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control
- Primal and dual active-set methods for convex quadratic programming
- A sparsity preserving convexification procedure for indefinite quadratic programs arising in direct optimal control
- QPCOMP
- rSQP++
- FSQP
- CFSQP
- SODAS
- DAESOL-II
- SolvIND
- QPSchur
- SQOPT
- ZQPCVX
- HPMPC
- DQP
- QPRefinement
- Block-structured quadratic programming for the direct multiple shooting method for optimal control
- A second derivative SQP method: global convergence
- QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming
- A computationally efficient feasible sequential quadratic programming algorithm
- Solving quadratic programs to high precision using scaled iterative refinement
- A nonlinear preconditioner for optimum experimental design problems
- An NE/SQP method for the bounded nonlinear complementarity problem
- A factorization with update procedures for a KKT matrix arising in direct optimal control
- A dual gradient-projection method for large-scale strictly convex quadratic problems
This page was built for software: QPOPT
