The general quadratic optimization problem

DOI10.1007/BF01580136zbMath0276.90044MaRDI QIDQ4401736

Edward L. Keller

Publication date: 1973

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

90C20: Quadratic programming

Related Items

Some generalizations of the criss-cross method for quadratic programming, A new proof for the criss-cross method for quadratic programming, Unnamed Item, A procedure for the one-parametric linear complementarity problem, An equivalence between two algorithms for general quadratic programming, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, A polynomial-time test for M-matrices, Criteria for copositive matrices, Testing the definiteness of matrices on polyhedral cones, Almost copositive matrices, Optimum design of plastic structures under displacement constraints, Almost definiteness of matrices on polyhedral cones, Determining subspaces on which a matrix is nonnegative definite, On the solution of large, structured linear complementarity problems: The tridiagonal case, A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems, A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming, Quadratic-programming criteria for copositive matrices, New variants of the criss-cross method for linearly constrained convex quadratic programming, Neural networks for computing in the elastoplastic analysis of structures, The Boolean pivot operation, \(M\)-matrices, and reducible matrices, Block pivoting and shortcut strategies for detecting copositivity, Equivalence of some quadratic programming algorithms, A unified approach to one-parametric general quadratic programming, Properties of the general quadratic optimization problem and the corresponding linear complementarity problem, Least-index resolution of degeneracy in quadratic programming

Cites Work

• Complementary pivot theory of mathematical programming
• A combinatorial approach to convex quadratic programming
• A Comparison of Two Methods for Quadratic Programming
• Bimatrix Equilibrium Points and Mathematical Programming
• The Symmetric Formulation of the Simplex Method for Quadratic Programming
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item