A merit function approach to the subgradient method with averaging
From MaRDI portal
Publication:5459823
DOI10.1080/10556780701318796zbMath1146.90050OpenAlexW2059050877MaRDI QIDQ5459823
Publication date: 29 April 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780701318796
Related Items
Unnamed Item ⋮ Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations ⋮ Subgradient algorithms on Riemannian manifolds of lower bounded curvatures ⋮ Dual subgradient method with averaging for optimal resource allocation ⋮ A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error stability properties of generalized gradient-type algorithms
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.
- The volume algorithm: Producing primal solutions with a subgradient method
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- Incremental Subgradient Methods for Nondifferentiable Optimization
- A Linearization Method for Nonsmooth Stochastic Programming Problems
- Stochastic approximation method with gradient averaging for unconstrained problems
- A dual scheme for traffic assignment problems
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- Ergodic convergence in subgradient optimization
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation
