Quasi-monotone subgradient methods for nonsmooth convex minimization
From MaRDI portal
Publication:2349846
DOI10.1007/s10957-014-0677-5zbMath1330.90078OpenAlexW2090852255MaRDI QIDQ2349846
Publication date: 18 June 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0677-5
rate of convergencenonsmooth optimizationconvex optimizationsubgradient methodsprimal-dual methodsmultiple averaging
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Minimax problems in mathematical programming (90C47)
Related Items (19)
Distributed price adjustment based on convex analysis ⋮ Exact penalties for decomposable convex optimization problems ⋮ Algorithms of inertial mirror descent in convex problems of stochastic optimization ⋮ Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization ⋮ Computation of Fisher-Gale equilibrium by auction ⋮ Discrete Choice Prox-Functions on the Simplex ⋮ A unitary distributed subgradient method for multi-agent optimization with different coupling sources ⋮ Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization ⋮ Unifying mirror descent and dual averaging ⋮ Algorithmic Principle of Least Revenue for Finding Market Equilibria ⋮ Unnamed Item ⋮ Regularized quasi-monotone method for stochastic optimization ⋮ Efficient first-order methods for convex minimization: a constructive approach ⋮ Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs ⋮ Complexity bounds for primal-dual methods minimizing the model of objective function ⋮ Dual subgradient method with averaging for optimal resource allocation ⋮ A non-monotone conjugate subgradient type method for minimization of convex functions ⋮ A family of subgradient-based methods for convex optimization problems in a unifying framework ⋮ Solving Large-Scale Optimization Problems with a Convergence Rate Independent of Grid Size
Cites Work
This page was built for publication: Quasi-monotone subgradient methods for nonsmooth convex minimization