Method of conditional ?-subgradient for solving convex programming problems

DOI10.1007/BF01068809zbMath0746.90067OpenAlexW2075214474MaRDI QIDQ4710661

Sergei V. Rzhevskii

Publication date: 25 June 1992

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01068809

zbMATH Keywords

necessary condition for optimality\(\varepsilon_ k\)-subdifferentialnonsmooth function on a convex set

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Cites Work

• Finding the nearest point in A polytope

This page was built for publication: Method of conditional ?-subgradient for solving convex programming problems