Pages that link to "Item:Q295450"

The following pages link to A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450):

Displaying 20 items.

• Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path (Q722338) (← links)
• A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem (Q1633334) (← links)
• An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277) (← 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 algorithm for symmetric optimization using a new wide neighborhood (Q1731107) (← 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)
• A wide neighborhood interior-point algorithm based on the trigonometric kernel function (Q2053067) (← links)
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
• A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization (Q2228421) (← 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)
• An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the <b>N∞−</b> neighbourhood of the central path (Q3177455) (← links)
• An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones (Q4959371) (← links)
• A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation (Q6166934) (← links)