Simplicial methods for quadratic programming

DOI10.1002/NAV.3800110304MaRDI QIDQ5510361zbMATH OpenOpenAlexFDO

Authors Andrew B. Whinston, C. van de Panne

Publication date 1964

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800110304

zbMATH Keywords

operations research

Cited in

(9)

• Quadratic programming problems and related linear complementarity problems
• Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
• Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
• Minimum energy problem for discrete linear admissible control systems
• Direct algorithms in quadratic programming
• An equivalence between two algorithms for general quadratic programming
• A numerically stable dual method for solving strictly convex quadratic programs
• On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs

This page was built for publication: Simplicial methods for quadratic programming

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