An optimal method of constructing an -subgradient

MaRDI QIDQ1323940zbMATHFDO

Authors N. T. Aliev

Publication date 6 July 1994

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

\(\varepsilon\)-subgradientnon-smooth function

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52)

Recommendations

• An approach to designing numerically implementable algorithms of the \(\epsilon\)-subgradient method
• Method of conditional ?-subgradient for solving convex programming problems
• A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
• ?-Subgradient mapping and the problem of convex optimization
• scientific article; zbMATH DE number 429229

Cited in

(7)

• An approach to designing numerically implementable algorithms of the \(\epsilon\)-subgradient method
• A general method of finding the direction of descent in \(\varepsilon\)-subgradient methods
• Finite \(\varepsilon\)-subgradient algorithm for approximate solution of the parametric programming problem
• scientific article; zbMATH DE number 4216030 (Why is no real title available?)
• Method of conditional ?-subgradient for solving convex programming problems
• Constructing a subgradient from directional derivatives for functions of two variables
• scientific article; zbMATH DE number 3972653 (Why is no real title available?)

This page was built for publication: An optimal method of constructing an \(\varepsilon\)-subgradient

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323940)