FBstab: A Stabilized Semismooth Quadratic Programming Algorithm with Applications in Model Predictive Control
Preprint
Abstract
This paper introduces the proximally stabilized Fischer-Burmeister method (FBstab); a new algorithm for convex quadratic programming that synergistically combines the proximal point algorithm with a primal-dual semismooth Newton-type method. FBstab is numerically robust, easy to warmstart, handles degenerate primal-dual solutions, detects infeasibility/unboundedness and requires only that the Hessian matrix be positive semidefinite. We outline the algorithm, provide convergence and convergence rate proofs, report some numerical results from model predictive control benchmarks, and also include experimental results. We show that FBstab is competitive with and often superior to, state of the art methods, has attractive scaling properties, and is especially promising for model predictive control applications.Keywords
All Related Versions
- Version 1, 2019-01-13, ArXiv
- Version 2, 2019-05-19, ArXiv
- Published version: Automatica, 113.
This publication has 25 references indexed in Scilit:
- OSQP: an operator splitting solver for quadratic programsMathematical Programming Computation, 2020
- Infeasibility Detection in the Alternating Direction Method of Multipliers for Convex OptimizationJournal of Optimization Theory and Applications, 2019
- Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programsAutomatica, 2018
- A dual gradient-projection algorithm for model predictive control in fixed-point arithmeticAutomatica, 2015
- CVXGEN: a code generator for embedded convex optimizationOptimization and Engineering, 2011
- A global piecewise smooth Newton method for fast large-scale model predictive controlAutomatica, 2011
- A penalized Fischer-Burmeister NCP-functionMathematical Programming, 2000
- Fulfilling Hard Constraints in Uncertain Linear Systems by Reference ManagingAutomatica, 1998
- A numerically stable dual method for solving strictly convex quadratic programsMathematical Programming, 1983
- ber partielle und totale differenzierbarkeit von Funktionen mehrerer Variabeln und ber die Transformation der DoppelintegraleMathematische Annalen, 1919