Least-index resolution of degeneracy in quadratic programming

DOI10.1007/BF01588308zbMath0454.90055MaRDI QIDQ3902831

Richard W. Cottle, Yow-Yieh Chang

Publication date: 1980

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

degeneracy; finite algorithm; circling; double least-index rule; finiteness prove; Keller's algorithm; least-index pivot selection rules

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C20: Quadratic programming

Related Items

Some generalizations of the criss-cross method for quadratic programming, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, Almost copositive matrices, Almost definiteness of matrices on polyhedral cones, Selected bibliography on degeneracy, Pivot rules for linear programming: A survey on recent theoretical developments, A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming, Quadratic-programming criteria for copositive matrices, Systematic construction of examples for cycling in the simplex method, Equivalence of some quadratic programming algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• New Finite Pivoting Rules for the Simplex Method
• The general quadratic optimization problem
• Symmetric dual quadratic programs
• A Technique for Resolving Degeneracy in Linear Programming
• A Transformation of Which The Equation of Telegraphy is a Differential Invariant
• A note on cycling in the simplex method
• The Symmetric Formulation of the Simplex Method for Quadratic Programming
• Optimality conditions for quadratic programming
• Optimality and Degeneracy in Linear Programming