Quasi-monotone subgradient methods for nonsmooth convex minimization
From MaRDI portal
Publication:2349846
The authors present new subgradient methods for solving nonsmooth convex minimization problems in a finite dimensional setting. It is shown that, by using special multiple averaging schemes, these methods generate convergent minimizing sequences. Applications to primal-dual problems and numerical experiments are provided.
Recommendations
- Parallel subgradient method for nonsmooth convex optimization with a simple constraint
- A subgradient method with non-monotone line search
- Subgradient method for nonconvex nonsmooth optimization
- scientific article; zbMATH DE number 3910150
- A non-monotone conjugate subgradient type method for minimization of convex functions
Cites work
- Convex Analysis
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Primal-dual subgradient methods for convex problems
Cited in
(34)- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
- Primal-dual subgradient methods for convex problems
- Convergence of some algorithms for convex minimization
- Algorithms of inertial mirror descent in convex problems of stochastic optimization
- Computation of Fisher-Gale equilibrium by auction
- Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs
- Complexity bounds for primal-dual methods minimizing the model of objective function
- Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources
- Efficient first-order methods for convex minimization: a constructive approach
- A non-monotone conjugate subgradient type method for minimization of convex functions
- Distributed price adjustment based on convex analysis
- A subgradient method with non-monotone line search
- A family of subgradient-based methods for convex optimization problems in a unifying framework
- Numerical performance of subgradient methods in solving nonsmooth optimization problems
- Block stochastic gradient iteration for convex and nonconvex optimization
- Algorithmic principle of least revenue for finding market equilibria
- Parallel subgradient method for nonsmooth convex optimization with a simple constraint
- Monotone methods with averaging of subgradients and their stochastic finite-difference analogs
- Combined subgradient monotone methods for minimization of nonsmooth functions
- A Lyapunov analysis of accelerated methods in optimization
- On the convergence rate of the subgradient method with metric variation and its applications in neural network approximation schemes
- Exact penalties for decomposable convex optimization problems
- Discrete choice prox-functions on the simplex
- Solving large-scale optimization problems with a convergence rate independent of grid size
- Unifying mirror descent and dual averaging
- Regularized quasi-monotone method for stochastic optimization
- An accelerated distributed online gradient push-sum algorithm on time-varying directed networks
- Tight analyses for subgradient descent. I: Lower bounds
- Primal subgradient methods with predefined step sizes
- Exact convergence rate of the last iterate in subgradient methods
- Supervised learning with evolving tasks and performance guarantees
- On the last iterate convergence of momentum methods
- Dual subgradient method with averaging for optimal resource allocation
This page was built for publication: Quasi-monotone subgradient methods for nonsmooth convex minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349846)
