Pages that link to "Item:Q2867434"
From MaRDI portal
The following pages link to Primal–dual first-order methods for a class of cone programming (Q2867434):
Displaying 10 items.
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454) (← links)
- A fast splitting method tailored for Dantzig selector (Q887167) (← links)
- First order solutions in conic programming (Q890175) (← links)
- Accelerated first-order methods for hyperbolic programming (Q1717219) (← links)
- A preconditioning technique for first-order primal-dual splitting method in convex optimization (Q1992653) (← links)
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507) (← links)
- A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems (Q2234476) (← links)
- Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553) (← links)
- Primal-Dual First-Order Methods for Affinely Constrained Multi-block Saddle Point Problems (Q6161309) (← links)
- Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
