An optimal method of constructing an \(\varepsilon\)-subgradient

zbMATH Open0804.90102MaRDI QIDQ1323940

N. T. Aliev

Publication date: 6 July 1994

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

zbMATH Keywords

non-smooth function\(\varepsilon\)-subgradient

Mathematics Subject Classification ID

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

Related Items (4)

A general method of finding the direction of descent in \(\varepsilon\)-subgradient methods ⋮ Title not available (Why is that?) ⋮ Finite \(\varepsilon\)-subgradient algorithm for approximate solution of the parametric programming problem ⋮ Method of conditional ?-subgradient for solving convex programming problems

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)