Solving structured nonsmooth convex optimization with complexity O( ^-1/2)
From MaRDI portal
Publication:1752352
Recommendations
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- A residual-based algorithm for solving a class of structured nonsmooth optimization problems
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- OSGA: a fast subgradient algorithm with optimal complexity
Cites work
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
- A Globally Convergent Trust-Region Method for Large-Scale Symmetric Nonlinear Systems
- A method for finding structured sparse solutions to nonnegative least squares problems with applications
- Accelerated schemes for a class of variational inequalities
- An accelerated linearized alternating direction method of multipliers
- An Optimal Algorithm for Constrained Differentiable Convex Optimization
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- Barrier subgradient method
- Benchmarking optimization software with performance profiles.
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Compressed sensing
- Compressive sampling
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
- Double smoothing technique for large-scale linearly constrained convex optimization
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
- First-order methods of smooth convex optimization with inexact oracle
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 1421091 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Interpolation via weighted \(\ell_{1}\) minimization
- Introduction to Numerical Analysis
- Introductory lectures on convex optimization. A basic course.
- Iteratively reweighted least squares minimization for sparse recovery
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
- Nonsmooth Equations: Motivation and Algorithms
- On the acceleration of the double smoothing technique for unconstrained convex optimization problems
- Optimal primal-dual methods for a class of saddle point problems
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- OSGA: a fast subgradient algorithm with optimal complexity
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Primal-dual subgradient methods for convex problems
- Secant methods for semismooth equations
- Smooth minimization of non-smooth functions
- Smoothing and first order methods: a unified framework
- The CoMirror algorithm for solving nonsmooth constrained convex problems
- Trust Region Algorithms for Solving Nonsmooth Equations
- Universal gradient methods for convex optimization problems
Cited in
(10)- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- Accelerated gradient sliding for structured convex optimization
- A residual-based algorithm for solving a class of structured nonsmooth optimization problems
- 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
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- OSGA: a fast subgradient algorithm with optimal complexity
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
- Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
This page was built for publication: Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752352)
