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

DOI10.1007/S101070050089zbMATH Open0946.90091OpenAlexW1974587700MaRDI QIDQ1961979FDOQ1961979

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

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

zbMATH Keywords

quadratic programminginterior point methodscrossoverpartitionlinear complementarity problemsprincipal pivot transformssufficient matricesbasis 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)

Cited In (9)

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