On Convergence Properties of a Subgradient Method
From MaRDI portal
Publication:4810572
DOI10.1080/1055678031000111236zbMath1062.90048OpenAlexW2048395921MaRDI QIDQ4810572
Publication date: 16 August 2004
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/1055678031000111236
Related Items (22)
Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems ⋮ Convergence of inexact quasisubgradient methods with extrapolation ⋮ Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces ⋮ A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets ⋮ Exact penalties for decomposable convex optimization problems ⋮ Two iterative processes generated by regular vector fields in Banach spaces ⋮ A subgradient method for equilibrium problems involving quasiconvex bifunctions ⋮ Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee ⋮ Descent methods with computational errors in Banach spaces ⋮ A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods ⋮ Disciplined quasiconvex programming ⋮ Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions ⋮ Acceleration procedure for special classes of multi-extremal problems ⋮ On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian ⋮ Unnamed Item ⋮ Fixed point quasiconvex subgradient method ⋮ Unnamed Item ⋮ Abstract convergence theorem for quasi-convex optimization problems with applications ⋮ Adaptive subgradient method for the split quasi-convex feasibility problems ⋮ Quasi-convex feasibility problems: subgradient methods and convergence rates ⋮ Convergence rates of subgradient methods for quasi-convex optimization problems ⋮ Algorithms for the quasiconvex feasibility problem
This page was built for publication: On Convergence Properties of a Subgradient Method