Least-index resolution of degeneracy in quadratic programming

DOI10.1007/BF01588308zbMath0454.90055MaRDI QIDQ3902831

Yow-Yieh Chang, Richard W. Cottle

Publication date: 1980

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

zbMATH Keywords

degeneracyfinite algorithmcirclingdouble least-index rulefiniteness proveKeller's algorithmleast-index pivot selection rules

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items

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

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