Pages that link to "Item:Q2361136"

The following pages link to An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path (Q2361136):

Displaying 15 items.

• A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem (Q1633334) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
• On the extension of an arc-search interior-point algorithm for semidefinite optimization (Q1713225) (← links)
• An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood (Q2048820) (← links)
• A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (Q2050559) (← links)
• An infeasible interior-point arc-search algorithm for nonlinear constrained optimization (Q2066199) (← links)
• An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs (Q2173343) (← links)
• A primal-dual interior-point algorithm with arc-search for semidefinite programming (Q2311204) (← links)
• A corrector-predictor arc search interior-point algorithm for symmetric optimization (Q2313142) (← links)
• An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems (Q2399607) (← links)
• An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (Q2674577) (← links)
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (Q3176174) (← links)
• A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs (Q4639138) (← links)
• An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones (Q4959371) (← links)
• A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777) (← links)