Pages that link to "Item:Q2311204"

The following pages link to A primal-dual interior-point algorithm with arc-search for semidefinite programming (Q2311204):

Displaying 9 items.

• 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)
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
• An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (Q2674577) (← links)
• The research of a modified primal-dual interior-point algorithm for SDP (Q2886581) (← links)
• A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777) (← links)
• An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems (Q6541376) (← links)