A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
From MaRDI portal
Publication:2419534
DOI10.1007/S10589-019-00058-0zbMath1420.90042arXiv1810.09243OpenAlexW2897905020WikidataQ128296398 ScholiaQ128296398MaRDI QIDQ2419534
Publication date: 13 June 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.09243
regularizationconvex quadratic programmingconstraint reductionprimal-dual interior-point methodactive constraints identificationMehrotra's predictor-corrector
Related Items (3)
Subgradient regularized multivariate convex regression at scale ⋮ A Positive Asymptotic-Preserving Scheme for Linear Kinetic Transport Equations ⋮ An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Active-set prediction for interior point methods using controlled perturbations
- A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
- Adaptive constraint reduction for convex quadratic programming
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems
- Quadratic regularizations in an interior-point method for primal block-angular problems
- An active-set strategy in an interior point method for linear programming
- Adaptive constraint reduction for training support vector machines
- A ``build-down scheme for linear programming
- Stability in the presence of degeneracy and error estimation
- On well definedness of the central path
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization
- Positive Filtered P$_N$ Moment Closures for Linear Kinetic Equations
- Graph Implementations for Nonsmooth Convex Programs
- A Feasible Active Set QP-Free Method for Nonlinear Programming
- On the Implementation of a Primal-Dual Interior Point Method
- On the Accurate Identification of Active Constraints
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Modifying SQP for Degenerate Problems
- Infeasible constraint-reduced interior-point methods for linear optimization
- Constraint Reduction for Linear Programs with Many Inequality Constraints
This page was built for publication: A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
