Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
From MaRDI portal
Publication:1752352
DOI10.1007/s11750-017-0462-3zbMath1391.90466OpenAlexW2745946318WikidataQ59607693 ScholiaQ59607693MaRDI QIDQ1752352
Arnold Neumaier, Masoud Ahookhosh
Publication date: 24 May 2018
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-017-0462-3
subgradient methodsproximity operatoroptimal complexityfirst-order black-box informationstructured nonsmooth convex 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
OSGA: a fast subgradient algorithm with optimal complexity, 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, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Smooth minimization of non-smooth functions
- OSGA: a fast subgradient algorithm with optimal complexity
- Gradient methods for minimizing composite functions
- 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
- Barrier subgradient method
- Interpolation via weighted \(\ell_{1}\) minimization
- Secant methods for semismooth equations
- Introductory lectures on convex optimization. A basic course.
- Accelerated schemes for a class of variational inequalities
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
- 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
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- Smoothing and First Order Methods: A Unified Framework
- Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization
- Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
- Nonsmooth Equations: Motivation and Algorithms
- A Globally Convergent Trust-Region Method for Large-Scale Symmetric Nonlinear Systems
- Iteratively reweighted least squares minimization for sparse recovery
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Introduction to Numerical Analysis
- Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
- Trust Region Algorithms for Solving Nonsmooth Equations
- On the acceleration of the double smoothing technique for unconstrained convex optimization problems
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- An Accelerated Linearized Alternating Direction Method of Multipliers
- Excessive Gap Technique in Nonsmooth Convex Minimization
- An Optimal Algorithm for Constrained Differentiable Convex Optimization
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Compressed sensing
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
- Benchmarking optimization software with performance profiles.
