Pages that link to "Item:Q2311204"
From MaRDI portal
The following pages link to A primal-dual interior-point algorithm with arc-search for semidefinite programming (Q2311204):
Displaying 5 items.
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood (Q2048820) (← 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)
- A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777) (← links)
