Pages that link to "Item:Q687036"

The following pages link to An active-set strategy in an interior point method for linear programming (Q687036):

Displaying 12 items.

• Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
• A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
• Adaptive constraint reduction for convex quadratic programming (Q434155) (← links)
• A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
• An active set strategy based on the multiplier function or the gradient. (Q622855) (← links)
• Active set and interior methods for nonlinear optimization (Q1126864) (← links)
• A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
• Identifying an optimal basis in linear programming (Q1915926) (← links)
• A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)
• A comparison of a Moreau-Yosida-based active set strategy and interior point methods for constrained optimal control problems (Q2706340) (← links)
• (Q4206316) (← links)
• Infeasible constraint-reduced interior-point methods for linear optimization (Q5200562) (← links)