Pages that link to "Item:Q1915904"

The following pages link to An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904):

Displaying 6 items.

• Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
• A predictor-corrector infeasible-interior-point algorithm for linear programming (Q1342276) (← links)
• Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
• A new infeasible interior-point method based on Darvay's technique for symmetric optimization (Q2449352) (← links)
• Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)