Pages that link to "Item:Q1181909"

The following pages link to A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' (Q1181909):

Displaying 14 items.

• Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
• A new warmstarting strategy for the primal-dual column generation method (Q494315) (← links)
• A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← 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)
• Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
• On combined phase 1-phase 2 projective methods for linear programming (Q1207329) (← links)
• Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming (Q1338138) (← links)
• Potential-reduction methods in mathematical programming (Q1361104) (← links)
• An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
• New complexity results for the Iri-Imai method (Q1915925) (← links)
• A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696) (← links)
• Combining phase I and phase II in a potential reduction algorithm for linear programming (Q2368075) (← links)
• On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494) (← links)