On active-set methods for quadratic problems with positive semidefinite matrices

DOI10.1007/978-3-031-73365-9_3MaRDI QIDQ6945733zbMATH OpenFDO

Authors Igor' Leonidovich Vasilyev, Tatiana V. Gruzdeva, Mariia Barkova, Denis Boyarkin, Dmitrii Iakubovskii

Publication date 8 August 2025

Full work available at URL https://doi.org/10.1007/978-3-031-73365-9_3

zbMATH Keywords

DC functiondual active-set methodlocal searchpositive semidefinite matricesquadratic programmingwarm-start

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26)

Cites work

• A Dual Active-Set Solver for Embedded Quadratic Programming Using Recursive LDL$^{T}$ Updates
• A dual-active-set algorithm for positive semi-definite quadratic programming
• A numerically stable dual method for solving strictly convex quadratic programs
• A repository of convex quadratic programming problems
• Constrained model predictive control: Stability and optimality
• Convex analysis and global optimization
• scientific article; zbMATH DE number 3658896 (Why is no real title available?)
• scientific article; zbMATH DE number 3551792 (Why is no real title available?)
• scientific article; zbMATH DE number 976325 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 914364 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• Large scale model predictive control with neural networks and primal active sets
• Lectures on convex optimization
• Mixed-integer nonlinear optimization
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• On local search in d.c. optimization problems
• On solving optimization problems with hidden nonconvex structures
• On the quadratic programming algorithm of Goldfarb and Idnani
• OSQP: an operator splitting solver for quadratic programs
• Parallelizing the dual revised simplex method
• Primal and dual active-set methods for convex quadratic programming
• qpOASES: a parametric active-set algorithm for~quadratic programming
• Robust Statistics
• SCIP: solving constraint integer programs
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Support-vector networks
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

This page was built for publication: On active-set methods for quadratic problems with positive semidefinite matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945733)