The general quadratic optimization problem
From MaRDI portal
Publication:4401736
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3270344 (Why is no real title available?)
- scientific article; zbMATH DE number 3284926 (Why is no real title available?)
- scientific article; zbMATH DE number 3283410 (Why is no real title available?)
- scientific article; zbMATH DE number 3288282 (Why is no real title available?)
- scientific article; zbMATH DE number 3312380 (Why is no real title available?)
- scientific article; zbMATH DE number 3350062 (Why is no real title available?)
- scientific article; zbMATH DE number 3363351 (Why is no real title available?)
- A Comparison of Two Methods for Quadratic Programming
- A combinatorial approach to convex quadratic programming
- Bimatrix Equilibrium Points and Mathematical Programming
- Complementary pivot theory of mathematical programming
- Duality Theory of Linear Programs: A Constructive Approach with Applications
- The Symmetric Formulation of the Simplex Method for Quadratic Programming
Cited in
(27)- scientific article; zbMATH DE number 2115448 (Why is no real title available?)
- Block pivoting and shortcut strategies for detecting copositivity
- Some generalizations of the criss-cross method for quadratic programming
- An equivalence between two algorithms for general quadratic programming
- New variants of the criss-cross method for linearly constrained convex quadratic programming
- A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming
- Almost copositive matrices
- Almost definiteness of matrices on polyhedral cones
- Neural networks for computing in the elastoplastic analysis of structures
- Properties of the general quadratic optimization problem and the corresponding linear complementarity problem
- A quadratic simplex algorithm for primal optimization over zero-one polytopes
- The Boolean pivot operation, \(M\)-matrices, and reducible matrices
- Determining subspaces on which a matrix is nonnegative definite
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- A polynomial-time test for M-matrices
- A procedure for the one-parametric linear complementarity problem
- Least-index resolution of degeneracy in quadratic programming
- Equivalence of some quadratic programming algorithms
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- Criteria for copositive matrices
- Static hedging of weather and price risks in electricity markets
- A new proof for the criss-cross method for quadratic programming
- On the solution of large, structured linear complementarity problems: The tridiagonal case
- A unified approach to one-parametric general quadratic programming
- Testing the definiteness of matrices on polyhedral cones
- Quadratic-programming criteria for copositive matrices
- Optimum design of plastic structures under displacement constraints
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)
