Pages that link to "Item:Q4895609"

The following pages link to An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods (Q4895609):

Displaying 19 items.

• A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450) (← links)
• Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (Q881509) (← links)
• Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization (Q995953) (← links)
• Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (Q997220) (← links)
• Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
• On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
• A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
• A primal-dual interior-point algorithm with arc-search for semidefinite programming (Q2311204) (← links)
• A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems (Q2356344) (← links)
• Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path (Q2467158) (← links)
• A Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood (Q2800675) (← links)
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (Q3176174) (← links)
• A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization (Q3188450) (← links)
• A dynamic large-update primal‐dual interior-point method for linear optimization (Q4405939) (← links)
• Hessian distances and their applications in the complexity analysis of interior-point methods (Q5299911) (← links)
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path (Q5312760) (← links)
• A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)
• A polynomial interior-point algorithm with improved iteration bounds for linear optimization (Q6498419) (← links)