Basis- and partition identification for quadratic programming and linear complementarity problems

DOI10.1007/s101070050089zbMath0946.90091OpenAlexW1974587700MaRDI QIDQ1961979

Arjan B. Berkelaar, Kees Roos, Tamás Terlaky, Benjamin Jansen

Publication date: 30 January 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050089

zbMATH Keywords

partitionquadratic programminglinear complementarity problemsinterior point methodscrossoversufficient matricesprincipal pivot transformsbasis recoveryBalinski-Tucker tableauxCriss-Cross method

Mathematics Subject Classification ID

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

Related Items

Computing upper and lower bounds in interval decision trees, Lipschitz continuity of the optimal value function and KKT solution set in indefinite quadratic programs, Identifying the optimal partition in convex quadratic programming, On the sensitivity of the optimal partition for parametric second-order conic optimization, Unifying optimal partition approach to sensitivity analysis in conic optimization, Continuity of the optimal value function and optimal solutions of parametric mixed-integer quadratic programs, Sensitivity analysis in convex quadratic optimization: invariant support set interval