Subgradient method for minimization of convex functionals and some efficiency bounds
From MaRDI portal
DOI10.1007/BF01095693zbMATH Open0688.90044OpenAlexW2083145615MaRDI QIDQ1264094FDOQ1264094
Publication date: 1989
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01095693
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
Cites Work
Cited In (13)
- Title not available (Why is that?)
- A method for minimizing convex functions based on continuous approximations to the subdifferential
- A merit function approach to the subgradient method with averaging
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proximal analysis and minimization principles
- Bounded lower subdifferentiability optimization techniques: applications
- Monotone methods with averaging of subgradients and their stochastic finite-difference analogs
- Title not available (Why is that?)
- Subgradient algorithm for computing contraction metrics for equilibria
- Approximate subgradients and coderivatives in \(R^ n\)
- Two ``well-known properties of subgradient optimization
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)
