Pages that link to "Item:Q2386553"

The following pages link to Neighborhood-following algorithms for linear programming (Q2386553):

Displaying 23 items.

• A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450) (← links)
• A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood (Q306400) (← links)
• An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization (Q520262) (← links)
• An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming (Q644523) (← links)
• A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization (Q1646672) (← links)
• Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions (Q1697897) (← links)
• An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood (Q1731107) (← links)
• A new second-order corrector interior-point algorithm for semidefinite programming (Q1935927) (← links)
• An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs (Q2173343) (← links)
• A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization (Q2176832) (← links)
• A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood (Q2221151) (← links)
• Two wide neighborhood interior-point methods for symmetric cone optimization (Q2401022) (← links)
• A new infeasible-interior-point algorithm for linear programming over symmetric cones (Q2401787) (← links)
• A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming (Q2630833) (← links)
• A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity (Q2836103) (← links)
• A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming (Q2895672) (← links)
• A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log <i>ϵ</i>⁻¹) iteration complexity (Q3174878) (← links)
• A New Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming (Q3188443) (← links)
• A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs (Q4639138) (← links)
• A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming (Q5058407) (← links)
• An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming (Q5169450) (← links)
• A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)
• A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function (Q6158944) (← links)