Pages that link to "Item:Q2136507"
From MaRDI portal
The following pages link to On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507):
Displaying 6 items.
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454) (← links)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092) (← links)
- Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553) (← links)
- Primal–dual first-order methods for a class of cone programming (Q2867434) (← links)
- Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates (Q4971027) (← links)
- Duality in convex optimization for the hyperbolic augmented Lagrangian (Q6500232) (← links)
