Pages that link to "Item:Q635148"

The following pages link to Full Nesterov-Todd step infeasible interior-point method for symmetric optimization (Q635148):

Displaying 26 items.

• Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization (Q2841915) (← links)
• A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps (Q2911579) (← links)
• A corrector–predictor path-following method for second-order cone optimization (Q2958275) (← links)
• An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (Q2970393) (← 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)
• Simplified analysis of a full Nesterov–Todd step infeasible interior-point method for symmetric optimization (Q3462001) (← links)
• A full NT-step infeasible interior-point algorithm for semidefinite optimization (Q4603922) (← links)
• (Q4604968) (← links)
• New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function (Q4622797) (← links)
• A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization (Q4622888) (← links)
• The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction (Q4638912) (← links)
• A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs (Q4639138) (← links)
• A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i>_*(κ)-HLCP (Q4646542) (← links)
• An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones (Q4959371) (← links)
• Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the Cartesian<b><i>P</i></b>_*(κ)-LCP Over Symmetric Cones (Q4979787) (← 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)
• Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP (Q5198050) (← links)
• A projection and contraction method for symmetric cone complementarity problem (Q5238193) (← links)
• Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i>_*(κ)-SCLCP (Q5299915) (← links)
• (Q5409921) (← links)
• A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions (Q5745170) (← links)
• A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones (Q6161308) (← links)
• A class of new search directions for full-NT step feasible interior point method in semidefinite optimization (Q6186557) (← links)
• A full-Newton step infeasible interior point algorithm and its parameters analysis (Q6536945) (← links)