Pages that link to "Item:Q3177455"

The following pages link to An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the <b>N∞−</b> neighbourhood of the central path (Q3177455):

Displaying 7 items.

• 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)
• 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)
• An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (Q2674577) (← links)
• A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777) (← links)