Pages that link to "Item:Q5200562"

The following pages link to Infeasible constraint-reduced interior-point methods for linear optimization (Q5200562):

Displaying 7 items.

• A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
• An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods (Q2089775) (← links)
• Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization (Q2250064) (← links)
• A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)
• An infeasible interior proximal method for convex programming problems with linear constraints (Q2764699) (← links)
• Counterexample to a Conjecture on an Infeasible Interior-Point Method (Q3058510) (← links)
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming (Q4764308) (← links)