Pages that link to "Item:Q627455"

The following pages link to Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming (Q627455):

Displaying 24 items.

• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones (Q306357) (← links)
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← links)
• A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (Q493049) (← links)
• Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions (Q1644105) (← links)
• A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization (Q1646672) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
• An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood (Q1731107) (← links)
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones (Q1937004) (← links)
• A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization (Q2018491) (← links)
• A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (Q2050559) (← links)
• A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization (Q2228421) (← links)
• On the central paths in symmetric cone programming (Q2359786) (← links)
• An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path (Q2361136) (← 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 predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity (Q2836103) (← 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 Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization (Q3188450) (← links)
• A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs (Q4639138) (← links)
• Infeasible path-following interior point algorithm for Cartesian <i>P</i>_*(κ) nonlinear complementarity problems over symmetric cones (Q5026485) (← links)
• Infeasible Mehrotra-type predictor–corrector algorithm for cartesian <i>P</i>_*(κ) nonlinear complementarity problems over symmetric cones (Q5031768) (← links)
• An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization (Q5045166) (← links)
• A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming (Q5058407) (← links)
• An efficient second-order predictor-corrector infeasible primal-dual IPM algorithm with large iteration path updates for solving well-known SDO problems (Q6664882) (← links)