Subgradient method for minimization of convex functionals and some efficiency bounds

DOI10.1007/BF01095693zbMATH Open0688.90044OpenAlexW2083145615MaRDI QIDQ1264094FDOQ1264094

R. F. Khabibullin

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

zbMATH Keywords

subdifferentialreal Hilbert spacefinite convex functional

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48)

Cites Work

• Sufficient conditions for extremum, penalty functions and regularity

Cited In (10)

• 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?)
• Proximal analysis and minimization principles
• Bounded lower subdifferentiability optimization techniques: applications
• 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)