Least-index resolution of degeneracy in quadratic programming
From MaRDI portal
Publication:3902831
DOI10.1007/BF01588308zbMATH Open0454.90055MaRDI QIDQ3902831FDOQ3902831
Authors: Yow-Yieh Chang, R. W. Cottle 
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
degeneracyfinite algorithmcirclingdouble least-index rulefiniteness proveKeller's algorithmleast-index pivot selection rules
Cites Work
- Title not available (Why is that?)
- New Finite Pivoting Rules for the Simplex Method
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Optimality and Degeneracy in Linear Programming
- Symmetric dual quadratic programs
- Optimality conditions for quadratic programming
- A Technique for Resolving Degeneracy in Linear Programming
- The general quadratic optimization problem
- The Symmetric Formulation of the Simplex Method for Quadratic Programming
- A Transformation of Which The Equation of Telegraphy is a Differential Invariant
- Title not available (Why is that?)
- A note on cycling in the simplex method
Cited In (10)
- Almost definiteness of matrices on polyhedral cones
- Quadratic-programming criteria for copositive matrices
- Systematic construction of examples for cycling in the simplex method
- Some generalizations of the criss-cross method for quadratic programming
- A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming
- Pivot rules for linear programming: A survey on recent theoretical developments
- Selected bibliography on degeneracy
- Almost copositive matrices
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- Equivalence of some quadratic programming algorithms
This page was built for publication: Least-index resolution of degeneracy in quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902831)
