Pages that link to "Item:Q493059"
From MaRDI portal
The following pages link to Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059):
Displayed 12 items.
- A note on an inequality involving Jordan product in Euclidean Jordan algebras (Q276321) (← links)
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP (Q279828) (← links)
- Erratum to: ``Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization'' (Q1673906) (← links)
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
- Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions (Q1697897) (← links)
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence (Q2007836) (← links)
- An infeasible full NT-step interior point method for circular optimization (Q2360232) (← links)
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming (Q2630833) (← links)
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
- A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization (Q3188450) (← links)
- A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization (Q5031729) (← links)
- Corrector-predictor interior-point method with new search direction for semidefinite optimization (Q6159295) (← links)