Identifying the optimal partition in convex quadratic programming

DOI10.1016/j.orl.2007.02.010zbMath1151.90032OpenAlexW2051703780MaRDI QIDQ924889

Stephen E. Wright

Publication date: 29 May 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.02.010

zbMATH Keywords

linear programminglinear complementaritystrict complementaritymaximally complementary solutions

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Convergence behavior of interior-point algorithms
• Basis- and partition identification for quadratic programming and linear complementarity problems
• A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
• Sensitivity analysis in convex quadratic optimization: invariant support set interval
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Interior Point Methods for Linear Optimization
• Unnamed Item
• Unnamed Item