New variants of the criss-cross method for linearly constrained convex quadratic programming
type: Item
instance of: scholarly article
title: New variants of the criss-cross method for linearly constrained convex quadratic programming
zbMATH Open document ID: 1106.90056
author: Arif A. Akkeleş
author: László Balogh
author: Tibor Illés
published in: European Journal of Operational Research
publication date: 2004-08-16T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 2091289
zbMATH Keywords: Linearly constrained convex quadratic optimization
zbMATH Keywords: Linear complementarity problems
zbMATH Keywords: Criss-cross type algorithms
MaRDI profile type: Publication
full work available at URL: j.ejor.2003.08.008
OpenAlex ID: W1988949476
cites work: Q3134873
cites work: Q4003375
cites work: On the finiteness of the criss-cross method
cites work: LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
cites work: Criss-cross methods: A fresh view on pivot algorithms
cites work: The linear complementarity problem, sufficient matrices, and the criss- cross method
cites work: The general quadratic optimization problem
cites work: The role of pivoting in proving some fundamental theorems of linear algebra
cites work: Some generalizations of the criss-cross method for quadratic programming
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: A method of solution for quadratic programs
cites work: Q5608986
cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
cites work: Q4039868
cites work: A convergent criss-cross method
cites work: A new algorithm for quadratic programming
cites work: A new proof for the criss-cross method for quadratic programming
cites work: New variants of finite criss-cross pivot algorithms for linear programming
cites work: Q4347848
DOI: 10.1016/J.EJOR.2003.08.008
description: scientific article; zbMATH DE number 2091289