Fbstab: A proximally stabilized semismooth algorithm for convex quadratic programming

View Researcher's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Please contact us in case of a broken link from here

Authors Dominic Liao-McPherson, Ilya Kolmanovsky
Journal/Conference Name Automatica
Paper Category
Paper 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, and report some numerical results from model predictive control benchmarks and from the Maros–Meszaros test set. We show that FBstab is competitive with state of the art methods and is especially promising for model predictive control and other parameterized problems.
Date of publication 2020
Code Programming Language C++

Copyright Researcher 2022