A new proof for the criss-cross method for quadratic programming
From MaRDI portal
Publication:4327956
DOI10.1080/02331939208843835zbMath0817.90074OpenAlexW1991921085MaRDI QIDQ4327956
Publication date: 20 April 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939208843835
Related Items (5)
New variants of the criss-cross method for linearly constrained convex quadratic programming ⋮ Criss-cross methods: A fresh view on pivot algorithms ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ A procedure for the one-parametric linear complementarity problem
Cites Work
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
- On the finiteness of the criss-cross method
- Complementary pivot theory of mathematical programming
- A convergent criss-cross method
- Computational complexity of LCPs associated with positive definite symmetric matrices
- New Finite Pivoting Rules for the Simplex Method
- The general quadratic optimization problem
This page was built for publication: A new proof for the criss-cross method for quadratic programming