On Poljak's improved subgradient method

DOI10.1007/BF00938545zbMath0621.90075MaRDI QIDQ1090617

Sehun Kim, Seokha Koh

Publication date: 1988

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

subgradient methodnondifferentiable optimizationcutting plane methodsstronger lower bound

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (4)

Channel allocation in cellular radio networks ⋮ Optimal prioritized channel allocation in cellular mobile systems ⋮ A modified subgradient algorithm for Lagrangean relaxation ⋮ Convergence of a generalized subgradient method for nondifferentiable convex optimization

Cites Work

• A least-distance programming procedure for minimization problems under linear constraints
• An aggregate subgradient method for nonsmooth convex minimization
• Finding the nearest point in A polytope
• Minimization of unsmooth functionals
• Unnamed Item
• Unnamed Item

This page was built for publication: On Poljak's improved subgradient method