Using the ?-subgradient method to solve the dual and the primal mathematical programming problems

DOI10.1007/BF01074717zbMath0633.90063OpenAlexW2051654987WikidataQ57498657 ScholiaQ57498657MaRDI QIDQ3771978

Sergei V. Rzhevskii, Alexei V. Kuntsevich

Publication date: 1985

Published in: Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

\(\epsilon \)-subgradients

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Finding the nearest point in A polytope
• A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
• Unnamed Item
• Unnamed Item

This page was built for publication: Using the ?-subgradient method to solve the dual and the primal mathematical programming problems