An example of cycling in a feasible point algorithm

DOI10.1007/BF01589358MaRDI QIDQ3912363zbMATH OpenOpenAlexFDO

Authors M. J. D. Powell

Publication date 1981

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01589358

zbMATH Keywords

cyclinglinear constraintsactive setfeasible point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites work

• scientific article; zbMATH DE number 3446698 (Why is no real title available?)
• The Composite Simplex Algorithm
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints

Cited in

(3)

• On determining the on-line minimax linear fit to a discrete point set in the plane
• Phase I cycling under the most-obtuse-angle pivot rule
• A numerically stable dual method for solving strictly convex quadratic programs

This page was built for publication: An example of cycling in a feasible point algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3912363)