A combinatorial approach to convex quadratic programming

DOI10.1016/0024-3795(70)90006-6MaRDI QIDQ2539951zbMATH OpenOpenAlexWikidataFDO

Authors 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

Cites work

• A combinatorial approach to convex quadratic programming
• A duality theorem for non-linear programming
• Bimatrix Equilibrium Points and Mathematical Programming
• Complementary pivot theory of mathematical programming
• Duality in quadratic programming
• Equilibrium Points of Bimatrix Games
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3432469 (Why is no real title available?)
• scientific article; zbMATH DE number 3246195 (Why is no real title available?)
• scientific article; zbMATH DE number 3284926 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• scientific article; zbMATH DE number 3332063 (Why is no real title available?)
• scientific article; zbMATH DE number 3359957 (Why is no real title available?)
• scientific article; zbMATH DE number 3363351 (Why is no real title available?)
• scientific article; zbMATH DE number 3067835 (Why is no real title available?)
• Nonlinear programming -- a survey
• Nonlinear Programs with Positively Bounded Jacobians
• Symmetric dual quadratic programs
• Symposium on modern techniques for extremum problems-linear and nonlinear programming
• Systems of Linear Relations
• The Simplex Method for Quadratic Programming

Cited in

(10)

• 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
• Some generalizations of the criss-cross method for quadratic programming
• The general quadratic optimization problem
• Hybrid programs: Linear and least-distance

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

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