Counterexample to a Conjecture on an Infeasible Interior-Point Method

DOI10.1137/080729505zbMATH Open1202.90190OpenAlexW2101519529WikidataQ123197653 ScholiaQ123197653MaRDI QIDQ3058510

No author found.

Publication date: 3 December 2010

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: http://resolver.tudelft.nl/uuid:94be44d4-c28a-4bdd-9851-1600cc6fb165

zbMATH Keywords

conjecturelinear optimizationfull-step infeasible interior-point algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• An infeasible-interior-point algorithm using projections onto a convex set 👍 👎
• A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming 👍 👎
• Convergence of an Infeasible Interior-Point Algorithm from Arbitrary Positive Starting Points 👍 👎
• Infeasible constraint-reduced interior-point methods for linear optimization 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎

This page was built for publication: Counterexample to a Conjecture on an Infeasible Interior-Point Method