New variants of the criss-cross method for linearly constrained convex quadratic programming
From MaRDI portal
Publication:1877024
DOI10.1016/j.ejor.2003.08.008zbMath1106.90056OpenAlexW1988949476MaRDI QIDQ1877024
László Balogh, Tibor Illés, Arif A. Akkeleş
Publication date: 16 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.08.008
Criss-cross type algorithmsLinear complementarity problemsLinearly constrained convex quadratic optimization
Related Items
Exterior point simplex-type algorithms for linear and network optimization problems, Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules, The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems, Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied, New criss-cross type algorithms for linear complementarity problems with sufficient matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new algorithm for quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- On the finiteness of the criss-cross method
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- Criss-cross methods: A fresh view on pivot algorithms
- New variants of finite criss-cross pivot algorithms for linear programming
- The role of pivoting in proving some fundamental theorems of linear algebra
- A Method of Solution for Quadratic Programs
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A convergent criss-cross method
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- Some generalizations of the criss-cross method for quadratic programming
- A new proof for the criss-cross method for quadratic programming
- The general quadratic optimization problem
