Pages that link to "Item:Q623454"
From MaRDI portal
The following pages link to Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454):
Displaying 15 items.
- Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant (Q5093643) (← links)
- An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems (Q5147027) (← links)
- An Accelerated Linearized Alternating Direction Method of Multipliers (Q5250009) (← links)
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620) (← links)
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem (Q5506687) (← links)
- On inexact solution of auxiliary problems in tensor methods for convex optimization (Q5859013) (← links)
- A dual approach for optimal algorithms in distributed optimization over networks (Q5859014) (← links)
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis (Q6043137) (← links)
- Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence (Q6161312) (← links)
- Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming (Q6161315) (← links)
- Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
- Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)
- An inertial projection and contraction algorithm for pseudomonotone variational inequalities without Lipschitz continuity (Q6565284) (← links)
- Two classes of spectral three-term derivative-free method for solving nonlinear equations with application (Q6582395) (← links)
- Accelerated first-order methods for a class of semidefinite programs (Q6665390) (← links)
