On Convergence Properties of a Subgradient Method
From MaRDI portal
It is shown that the use of normalized support vectors to level sets in subgradient methods can be used to accelerate the convergence properties for the minimization of quasi-convex functions. As example, Hölder continuity of the function can be used to obtain convergence of the method, and the existence of both majorant and minorant functions leads to a linear convergence rate. To compute the step size in the algorithm (approximate) knowledge of the optimal function value is necessary.
Recommendations
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- A note on the convergence of subgradient optimization methods
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- scientific article; zbMATH DE number 3995464
- Faster subgradient methods for functions with Hölderian growth
Cited in
(38)- Two ``well-known properties of subgradient optimization
- Convergence of a subgradient method for computing the bound norm of matrices
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Acceleration procedure for special classes of multi-extremal problems
- Subgradient method with Polyak's step in transformed space
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- 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
- Disciplined quasiconvex programming
- Fixed point quasiconvex subgradient method
- Faster subgradient methods for functions with Hölderian growth
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- Algorithms for the quasiconvex feasibility problem
- A subgradient method for equilibrium problems involving quasiconvex bifunctions
- Adaptive subgradient method for the split quasi-convex feasibility problems
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
- The dual gap function and error bounds for strongly monotone variational inequalities
- 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
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- scientific article; zbMATH DE number 7201315 (Why is no real title available?)
- Descent methods with computational errors in Banach spaces
- Convergence analysis of deflected conditional approximate subgradient methods
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Convergence properties of the modified subgradient method of camerini et al
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
- Stability of the asymptotic behavior for continuous descent methods with a convex objective function
- A subgradient projection method for quasiconvex minimization
- On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
- A simultaneous quasi-subgradient method for minimizing convex function with quasi-convex functional constraints
- On quasi-convex smooth optimization problems by a comparison oracle
- Stochastic quasi-subgradient methods with Bregman projection for stochastic quasi-convex feasibility problems
- Optimization on solution sets of common fixed point problems with a countable family of maps
- Projected quasi-subgradient method for Hölder continuous quasi-convex multiobjective optimization
- Convergence rates of subgradient methods for quasi-convex optimization problems
This page was built for publication: On Convergence Properties of a Subgradient Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4810572)