An algorithm for calculating one subgradient of a convex function of two variables

DOI10.1007/BF01389336zbMath0671.65044OpenAlexW2037016126MaRDI QIDQ1119340

Marcin Studniarski

Publication date: 1989

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133377

zbMATH Keywords

algorithmnumerical examplessubdifferentialsubgradientconvex nondifferentiable optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (2)

Approximating Clarke's subgradients of semismooth functions by divided differences ⋮ Explainable subgradient tree boosting for prescriptive analytics in operations management

Cites Work

• An algorithm for linearly constrained convex nondifferentiable minimization problems
• A constraint linearization method for nondifferentiable convex minimization
• An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
• Convex Analysis

This page was built for publication: An algorithm for calculating one subgradient of a convex function of two variables