On Convergence Properties of a Subgradient Method

From MaRDI portal
Publication:4810572

DOI10.1080/1055678031000111236zbMath1062.90048OpenAlexW2048395921MaRDI QIDQ4810572

Igor V. Konnov

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 problemsConvergence of inexact quasisubgradient methods with extrapolationInterior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spacesA parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex setsExact penalties for decomposable convex optimization problemsTwo iterative processes generated by regular vector fields in Banach spacesA subgradient method for equilibrium problems involving quasiconvex bifunctionsMultiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guaranteeDescent methods with computational errors in Banach spacesA Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty MethodsDisciplined quasiconvex programmingIncremental quasi-subgradient methods for minimizing the sum of quasi-convex functionsAcceleration procedure for special classes of multi-extremal problemsOn a modified subgradient algorithm for dual problems via sharp augmented LagrangianUnnamed ItemFixed point quasiconvex subgradient methodUnnamed ItemAbstract convergence theorem for quasi-convex optimization problems with applicationsAdaptive subgradient method for the split quasi-convex feasibility problemsQuasi-convex feasibility problems: subgradient methods and convergence ratesConvergence rates of subgradient methods for quasi-convex optimization problemsAlgorithms for the quasiconvex feasibility problem




This page was built for publication: On Convergence Properties of a Subgradient Method