On Convergence Properties of a Subgradient Method
From MaRDI portal
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
(33)- A subgradient method for equilibrium problems involving quasiconvex bifunctions
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- Convergence analysis of deflected conditional approximate subgradient methods
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
- Acceleration procedure for special classes of multi-extremal problems
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Algorithms for the quasiconvex feasibility problem
- Subgradient method with Polyak's step in transformed space
- The dual gap function and error bounds for strongly monotone variational inequalities
- scientific article; zbMATH DE number 7201315 (Why is no real title available?)
- Exact penalties for decomposable convex optimization problems
- Descent methods with computational errors in Banach spaces
- Convergence of a subgradient method for computing the bound norm of matrices
- Convergence of inexact quasisubgradient methods with extrapolation
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- Adaptive subgradient method for the split quasi-convex feasibility problems
- Disciplined quasiconvex programming
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Fixed point quasiconvex subgradient method
- Stability of the asymptotic behavior for continuous descent methods with a convex objective function
- A subgradient projection method for quasiconvex minimization
- Abstract convergence theorem for quasi-convex optimization problems with applications
- A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Convergence properties of the modified subgradient method of camerini et al
- On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
- Faster subgradient methods for functions with Hölderian growth
- Two iterative processes generated by regular vector fields in Banach spaces
- Two ``well-known properties of subgradient optimization
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)
