Simplicial methods for quadratic programming
From MaRDI portal
Publication:5510361
DOI10.1002/nav.3800110304zbMath0136.14104OpenAlexW2143241251MaRDI QIDQ5510361
Andrew B. Whinston, Cornelis 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
Related Items
Quadratic programming problems and related linear complementarity problems, Direct algorithms in quadratic programming, A numerically stable dual method for solving strictly convex quadratic programs, An equivalence between two algorithms for general quadratic programming, Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra, Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied, Minimum energy problem for discrete linear admissible control systems, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
