Pages that link to "Item:Q2050559"
From MaRDI portal
The following pages link to A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (Q2050559):
Displaying 7 items.
- Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming (Q1434073) (← links)
- On the extension of an arc-search interior-point algorithm for semidefinite optimization (Q1713225) (← links)
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood (Q2048820) (← 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)