The general quadratic optimization problem
From MaRDI portal
Publication:4401736
DOI10.1007/BF01580136zbMath0276.90044OpenAlexW1974227908MaRDI QIDQ4401736
Publication date: 1973
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580136
Related Items (27)
A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming ⋮ Criteria for copositive matrices ⋮ New variants of the criss-cross method for linearly constrained convex quadratic programming ⋮ A unified approach to one-parametric general quadratic programming ⋮ The Boolean pivot operation, \(M\)-matrices, and reducible matrices ⋮ Neural networks for computing in the elastoplastic analysis of structures ⋮ Testing the definiteness of matrices on polyhedral cones ⋮ Almost copositive matrices ⋮ Properties of the general quadratic optimization problem and the corresponding linear complementarity problem ⋮ Some generalizations of the criss-cross method for quadratic programming ⋮ A new proof for the criss-cross method for quadratic programming ⋮ A quadratic simplex algorithm for primal optimization over zero-one polytopes ⋮ Optimum design of plastic structures under displacement constraints ⋮ Almost definiteness of matrices on polyhedral cones ⋮ Determining subspaces on which a matrix is nonnegative definite ⋮ Equivalence of some quadratic programming algorithms ⋮ Unnamed Item ⋮ An equivalence between two algorithms for general quadratic programming ⋮ Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids ⋮ On the solution of large, structured linear complementarity problems: The tridiagonal case ⋮ Least-index resolution of degeneracy in quadratic programming ⋮ Quadratic-programming criteria for copositive matrices ⋮ Static hedging of weather and price risks in electricity markets ⋮ Block pivoting and shortcut strategies for detecting copositivity ⋮ A polynomial-time test for M-matrices ⋮ A procedure for the one-parametric linear complementarity problem ⋮ A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
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
This page was built for publication: The general quadratic optimization problem
