A combinatorial approach to convex quadratic programming
From MaRDI portal
Publication:2539951
DOI10.1016/0024-3795(70)90006-6zbMath0198.24503WikidataQ114852136 ScholiaQ114852136MaRDI QIDQ2539951
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
Related Items
Some generalizations of the criss-cross method for quadratic programming, The general quadratic optimization problem, 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, Criteria for sufficient matrices, The Boolean pivot operation, \(M\)-matrices, and reducible matrices, 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