An improved subgradient method for constrained nondifferentiable optimization

DOI10.1016/0167-6377(93)90020-HzbMath0792.90071OpenAlexW2023925658MaRDI QIDQ1317025

Bong-sik Um, Sehun Kim

Publication date: 25 July 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90020-h

zbMATH Keywords

projectionconstrained nondifferentiable optimizationPolyak's subgradient method

Mathematics Subject Classification ID

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

Related Items (4)

Subgradient method with entropic projections for convex nondifferentiable minimization ⋮ Lagrangean/surrogate relaxation for generalized assignment problems ⋮ On global subdifferentials with applications in nonsmooth optimization ⋮ Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-direction subgradient method for non-differentiable optimization problems
• Convergence of a generalized subgradient method for nondifferentiable convex optimization
• Variable target value subgradient method
• Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
• Validation of subgradient optimization
• Minimization of unsmooth functionals

This page was built for publication: An improved subgradient method for constrained nondifferentiable optimization