The general quadratic optimization problem

DOI10.1007/BF01580136zbMATH Open0276.90044OpenAlexW1974227908MaRDI QIDQ4401736FDOQ4401736

Authors: Edward L. Keller 

Publication date: 1973

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

Full work available at URL: https://doi.org/10.1007/bf01580136

Mathematics Subject Classification ID

Quadratic programming (90C20)

Cites Work

• Title not available (Why is that?)
• Complementary pivot theory of mathematical programming
• Bimatrix Equilibrium Points and Mathematical Programming
• Title not available (Why is that?)
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Title not available (Why is that?)
• The Symmetric Formulation of the Simplex Method for Quadratic Programming
• Title not available (Why is that?)
• A Comparison of Two Methods for Quadratic Programming
• Title not available (Why is that?)
• A combinatorial approach to convex quadratic programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (27)

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

This page was built for publication: The general quadratic optimization problem

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