A combinatorial approach to convex quadratic programming

DOI10.1016/0024-3795(70)90006-6zbMath0198.24503OpenAlexW1993320306WikidataQ114852136 ScholiaQ114852136MaRDI QIDQ2539951

T. D. Parsons

Publication date: 1970

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(70)90006-6

zbMATH Keywords

operations research

Related Items (10)

The Boolean pivot operation, \(M\)-matrices, and reducible matrices ⋮ Criteria for sufficient matrices ⋮ Some generalizations of the criss-cross method for quadratic programming ⋮ Hybrid programs: Linear and least-distance ⋮ Almost definiteness of matrices on polyhedral cones ⋮ Determining subspaces on which a matrix is nonnegative definite ⋮ A saddlepoint theorem for self-dual linear systems ⋮ The general quadratic optimization problem ⋮ A combinatorial approach to convex quadratic programming ⋮ On the number of solutions to the complementarity problem and spanning properties of complementary cones

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complementary pivot theory of mathematical programming
• A combinatorial approach to convex quadratic programming
• Non-Linear Programming—A Survey
• Duality in quadratic programming
• The Simplex Method for Quadratic Programming
• A duality theorem for non-linear programming
• Symmetric dual quadratic programs
• Equilibrium Points of Bimatrix Games
• Symposium on Modern Techniques for Extremum Problems—Linear and Nonlinear Programming
• Bimatrix Equilibrium Points and Mathematical Programming
• Nonlinear Programs with Positively Bounded Jacobians
• Systems of Linear Relations

This page was built for publication: A combinatorial approach to convex quadratic programming