OSGA: a fast subgradient algorithm with optimal complexity
From MaRDI portal
Publication:304218
DOI10.1007/s10107-015-0911-4zbMath1346.90671arXiv1402.1125OpenAlexW1516695992MaRDI QIDQ304218
Publication date: 25 August 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.1125
nonsmooth optimizationconvex optimizationlarge-scale optimizationcomplexity boundstrongly convexNesterov's optimal methodoptimal first-order methodoptimal subgradient methodsmooth optimization
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Numerical methods based on nonlinear programming (49M37)
Related Items
An optimal subgradient algorithm for large-scale bound-constrained convex optimization, An optimal subgradient algorithm with subspace search for costly convex optimization problems, Optimal subgradient algorithms for large-scale convex optimization in simple domains, String-averaging incremental stochastic subgradient algorithms, Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\), The unitary 𝕀–spherical dual for split 𝕡–adic groups of type 𝔽₄, Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity, Optimal subgradient methods: computational properties for large-scale linear inverse problems, The method of codifferential descent for convex and global piecewise affine optimization, On Modification of an Adaptive Stochastic Mirror Descent Algorithm for Convex Optimization Problems with Functional Constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Gradient methods for minimizing composite functions
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- First-order methods of smooth convex optimization with inexact oracle
- Universal gradient methods for convex optimization problems
- The CoMirror algorithm for solving nonsmooth constrained convex problems
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Matrix-free interior point method for compressed sensing problems
- On the rate of convergence of the preconditioned conjugate gradient method
- Introductory lectures on convex optimization. A basic course.
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- Templates for convex cone problems with applications to sparse signal recovery
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
- A First-Order Augmented Lagrangian Method for Compressed Sensing
- Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
- Improved Algorithms for Convex Minimization in Relative Scale
- Unconstrained Convex Minimization in Relative Scale
- A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs
- An Optimal Algorithm for Constrained Differentiable Convex Optimization
- Rounding of convex sets and efficient gradient methods for linear programming problems
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
