A sparsity preserving convexification procedure for indefinite quadratic programs arising in direct optimal control
DOI10.1137/16M1081543zbMATH Open1376.49036MaRDI QIDQ5363377FDOQ5363377
Authors: Robin Verschueren, Mario Zanon, Rien Quirynen, Moritz Diehl 
Publication date: 6 October 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Recommendations
- A primal-dual regularized interior-point method for convex quadratic programs
- A stable and efficient method for solving a convex quadratic program with application to optimal control
- Resolution of a linear-quadratic optimal control problem based on finite-dimensional models
- Sparsity in convex quadratic programming with interior point methods
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
Quadratic programming (90C20) Nonlinear programming (90C30) Existence theories for optimal control problems involving ordinary differential equations (49J15) Numerical methods of relaxation type (49M20)
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A parallel quadratic programming method for dynamic optimization problems
- Efficient numerical methods for nonlinear MPC and moving horizon estimation
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Title not available (Why is that?)
- Determination of the inertia of a partitioned Hermitian matrix
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- A Globally Convergent Stabilized SQP Method
- Differential dynamic programming and Newton's method for discrete optimal control problems
- Title not available (Why is that?)
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- A second derivative SQP method: local convergence and practical issues
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- An alternative use of the Riccati recursion for efficient optimization
- Structured regularization for barrier NLP solvers
- Autogenerating microsecond solvers for nonlinear MPC: a tutorial using ACADO integrators
- Title not available (Why is that?)
Cited In (5)
- \texttt{acados} -- a modular open-source framework for fast embedded optimal control
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming
- Exponential decay in the sensitivity analysis of nonlinear dynamic programming
- Multi-level iterations for economic nonlinear model predictive control
- Direct optimal control and model predictive control
Uses Software
This page was built for publication: A sparsity preserving convexification procedure for indefinite quadratic programs arising in direct optimal control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363377)
