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

DOI10.1007/S101070050089MaRDI QIDQ1961979zbMATH OpenOpenAlexFDO

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

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

Balinski-Tucker tableauxbasis recoveryCriss-Cross methodcrossoverinterior point methodslinear complementarity problemspartitionprincipal pivot transformsquadratic programmingsufficient matrices

Mathematics Subject Classification ID

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

Recommendations

• Identifying the optimal partition in convex quadratic programming
• The complementary basis method for problems of convex quadratic programming
• scientific article; zbMATH DE number 1163807
• A method of complementary basis for quadratic programming
• On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming
• An optimal-basis identification technique for interior-point linear programming algorithms
• scientific article; zbMATH DE number 1008715
• scientific article; zbMATH DE number 4218451
• On the identification of the optimal partition for semidefinite optimization
• Quadratic programming problems and related linear complementarity problems

Cited in

(9)

• Crashing a maximum-weight complementary basis
• Finding an interior point in the optimal face of linear programs
• On the sensitivity of the optimal partition for parametric second-order conic optimization
• Sensitivity analysis in convex quadratic optimization: invariant support set interval
• 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
• 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

This page was built for publication: Basis- and partition identification for quadratic programming and linear complementarity problems

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