Pages that link to "Item:Q806962"

The following pages link to Theoretical efficiency of a shifted-barrier-function algorithm for linear programming (Q806962):

Displaying 14 items.

• Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
• A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← links)
• Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
• A combined phase I-phase II scaled potential algorithm for linear programming (Q1181908) (← links)
• A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' (Q1181909) (← links)
• Scaling, shifting and weighting in interior-point methods (Q1342881) (← links)
• A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
• Differential-algebraic approach to linear programming (Q1862190) (← links)
• An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
• The Newton modified barrier method for QP problems (Q1915923) (← links)
• Combining phase I and phase II in a potential reduction algorithm for linear programming (Q2368075) (← links)
• An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming (Q2477012) (← links)
• Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
• A Single-Phase, Proximal Path-Following Framework (Q5219702) (← links)