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):
Displayed 26 items.
- An adaptive accelerated first-order method for convex optimization (Q276852) (← links)
- Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
- Implementation of an optimal first-order method for strongly convex total variation regularization (Q438730) (← links)
- Smoothing proximal gradient method for general structured sparse regression (Q439167) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
- An alternating direction method for finding Dantzig selectors (Q1927184) (← links)
- Iteration-complexity of first-order penalty methods for convex programming (Q1949272) (← links)
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming (Q1949275) (← links)
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming (Q1949595) (← links)
- Performance of first-order methods for smooth convex minimization: a novel approach (Q2248759) (← links)
- An efficient primal dual prox method for non-smooth optimization (Q2339936) (← links)
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators (Q2340520) (← links)
- A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
- Adaptive restart for accelerated gradient schemes (Q2355332) (← links)
- A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results (Q2434998) (← links)
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
- Super-Resolution of Positive Sources: The Discrete Setup (Q2797786) (← links)
- A family of subgradient-based methods for convex optimization problems in a unifying framework (Q2829570) (← links)
- Primal–dual first-order methods for a class of cone programming (Q2867434) (← links)
- Polyhedral approximations in<i>p</i>-order cone programming (Q2926080) (← links)
- A smoothing stochastic gradient method for composite optimization (Q2926083) (← links)
- An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming (Q2945128) (← links)
- Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems (Q3451761) (← links)
- An Accelerated Linearized Alternating Direction Method of Multipliers (Q5250009) (← links)