Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
From MaRDI portal
Publication:2515032
DOI10.1007/s10107-013-0737-xzbMath1321.90104arXiv1309.5547OpenAlexW2053434217MaRDI QIDQ2515032
Publication date: 9 February 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.5547
Related Items (38)
A Trust-region Method for Nonsmooth Nonconvex Optimization ⋮ OSGA: a fast subgradient algorithm with optimal complexity ⋮ A proximal method for composite minimization ⋮ Accelerated gradient sliding for structured convex optimization ⋮ On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients ⋮ A Level-Set Method for Convex Optimization with a Feasible Solution Path ⋮ Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization ⋮ A multi-step doubly stabilized bundle method for nonsmooth convex optimization ⋮ Rate of convergence of the bundle method ⋮ An optimal subgradient algorithm with subspace search for costly convex optimization problems ⋮ Fast bundle-level methods for unconstrained and ball-constrained convex optimization ⋮ Universal Conditional Gradient Sliding for Convex Optimization ⋮ Optimal subgradient algorithms for large-scale convex optimization in simple domains ⋮ Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization ⋮ Optimal Methods for Convex Risk-Averse Distributed Optimization ⋮ Optimal Convergence Rates for the Proximal Bundle Method ⋮ Block mirror stochastic gradient method for stochastic optimization ⋮ On optimal universal first-order methods for minimizing heterogeneous sums ⋮ General Hölder smooth convergence rates follow from specialized rates assuming growth bounds ⋮ Accelerated first-order methods for hyperbolic programming ⋮ Conditional gradient type methods for composite nonlinear and stochastic optimization ⋮ Inexact proximal stochastic second-order methods for nonconvex composite optimization ⋮ Target radius methods for nonsmooth convex optimization ⋮ Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) ⋮ Dynamic stochastic approximation for multi-stage stochastic optimization ⋮ Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization ⋮ Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point ⋮ Unnamed Item ⋮ A class of exact penalty functions and penalty algorithms for nonsmooth constrained 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 ⋮ Generalized uniformly optimal methods for nonlinear programming ⋮ A new restricted memory level bundle method for constrained convex nonsmooth optimization ⋮ Efficient Algorithms for Distributionally Robust Stochastic Optimization with Discrete Scenario Support ⋮ An Accelerated Linearized Alternating Direction Method of Multipliers ⋮ A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes ⋮ Inexact model: a framework for optimization and variational inequalities ⋮ On stochastic accelerated gradient with convergence rate
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A proximal method for composite minimization
- First-order methods of smooth convex optimization with inexact oracle
- Approximate level method for nonsmooth convex minimization
- An optimal method for stochastic composite optimization
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Validation analysis of mirror descent stochastic approximation method
- Smoothing technique and its applications in semidefinite optimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- Newton's method for convex programming and Tschebyscheff approximation
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- On parallel complexity of nonsmooth convex optimization
- Introductory lectures on convex optimization. A basic course.
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Decomposition algorithms for stochastic programming on a computational grid
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- New variants of bundle methods
- The empirical behavior of sampling methods for stochastic programming
- Lectures on Modern Convex Optimization
- An aggregate subgradient method for nonsmooth convex minimization
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- The Cutting-Plane Method for Solving Convex Programs
- First-Order Methods for Sparse Covariance Selection
- Robust Stochastic Approximation Approach to Stochastic Programming
- Smooth Optimization Approach for Sparse Covariance Selection
- Optimal methods of smooth convex minimization
- A Spectral Bundle Method for Semidefinite Programming
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
This page was built for publication: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
