Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
type: Item
instance of: scholarly article
title: Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
zbMATH Open document ID: 1391.90466
author: Masoud Ahookhosh
author: Arnold Neumaier
published in: Top
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6872318
zbMATH Keywords: structured nonsmooth convex optimization
zbMATH Keywords: subgradient methods
zbMATH Keywords: proximity operator
zbMATH Keywords: optimal complexity
zbMATH Keywords: first-order black-box information
describes a project that uses: fminsearch
describes a project that uses: NESUN
describes a project that uses: UNLocBoX
MaRDI profile type: Publication
full work available at URL: s11750-017-0462-3
OpenAlex ID: W2745946318
Wikidata QID: Q59607693
cites work: Primal-dual subgradient methods for convex problems
cites work: A Globally Convergent Trust-Region Method for Large-Scale Symmetric Nonlinear Systems
cites work: Gradient methods for minimizing composite functions
cites work: An optimal subgradient algorithm with subspace search for costly convex optimization problems
cites work: An optimal subgradient algorithm for large-scale bound-constrained convex optimization
cites work: Optimal subgradient algorithms for large-scale convex optimization in simple domains
cites work: Interior Gradient and Proximal Methods for Convex and Conic Optimization
cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization.
cites work: Smoothing and first order methods: a unified framework
cites work: The CoMirror algorithm for solving nonsmooth constrained convex problems
cites work: A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
cites work: On the acceleration of the double smoothing technique for unconstrained convex optimization problems
cites work: Q5491042
cites work: Optimal Primal-Dual Methods for a Class of Saddle Point Problems
cites work: Accelerated schemes for a class of variational inequalities
cites work: An Accelerated Linearized Alternating Direction Method of Multipliers
cites work: Fast bundle-level methods for unconstrained and ball-constrained convex optimization
cites work: Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
cites work: Iteratively reweighted least squares minimization for sparse recovery
cites work: First-order methods of smooth convex optimization with inexact oracle
cites work: Double smoothing technique for large-scale linearly constrained convex optimization
cites work: Benchmarking optimization software with performance profiles.
cites work: Compressed sensing
cites work: A method for finding structured sparse solutions to nonnegative least squares problems with applications
cites work: Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
cites work: An Optimal Algorithm for Constrained Differentiable Convex Optimization
cites work: Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
cites work: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
cites work: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
cites work: Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
cites work: Q3967358
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Q3320132
cites work: Smooth minimization of non-smooth functions
cites work: Excessive Gap Technique in Nonsmooth Convex Minimization
cites work: Barrier subgradient method
cites work: Universal gradient methods for convex optimization problems
cites work: OSGA: a fast subgradient algorithm with optimal complexity
cites work: Introduction to Numerical Analysis
cites work: Nonsmooth Equations: Motivation and Algorithms
cites work: Secant methods for semismooth equations
cites work: Trust Region Algorithms for Solving Nonsmooth Equations
cites work: Q4946118
cites work: Interpolation via weighted \(\ell_{1}\) minimization
cites work: Q5187067
cites work: Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
DOI: 10.1007/S11750-017-0462-3
description: scientific article; zbMATH DE number 6872318