Pages that link to "Item:Q623454"

The following pages link to Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454):

Displaying 44 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)
• Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
• Accelerated first-order methods for hyperbolic programming (Q1717219) (← links)
• Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
• Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
• An optimal randomized incremental gradient method (Q1785198) (← 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)
• Dynamic stochastic approximation for multi-stage stochastic optimization (Q2020613) (← links)
• A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems (Q2044494) (← links)
• Fastest rates for stochastic mirror descent methods (Q2044496) (← links)
• Accelerated gradient sliding for structured convex optimization (Q2141354) (← links)
• Proportional-integral projected gradient method for conic optimization (Q2151872) (← links)
• A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
• Algorithms for stochastic optimization with function or expectation constraints (Q2181600) (← links)
• Performance of first-order methods for smooth convex minimization: a novel approach (Q2248759) (← links)
• Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) (← links)
• Environmental game modeling with uncertainties (Q2321654) (← 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)
• An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)
• Iteratively reweighted \(\ell _1\) algorithms with extrapolation (Q2419549) (← 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)
• Matrix-Free Convex Optimization Modeling (Q2957708) (← 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)
• Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)