Subgradient method for minimization of convex functionals and some efficiency bounds
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3910168
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- scientific article; zbMATH DE number 3995464
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
Cited in
(13)- A method for minimizing convex functions based on continuous approximations to the subdifferential
- Approximate subgradients and coderivatives in \(R^ n\)
- scientific article; zbMATH DE number 3995464 (Why is no real title available?)
- Two ``well-known properties of subgradient optimization
- scientific article; zbMATH DE number 3854325 (Why is no real title available?)
- scientific article; zbMATH DE number 3910168 (Why is no real title available?)
- Bounded lower subdifferentiability optimization techniques: applications
- Proximal analysis and minimization principles
- scientific article; zbMATH DE number 175883 (Why is no real title available?)
- Monotone methods with averaging of subgradients and their stochastic finite-difference analogs
- Subgradient algorithm for computing contraction metrics for equilibria
- A merit function approach to the subgradient method with averaging
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
This page was built for publication: Subgradient method for minimization of convex functionals and some efficiency bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264094)
