An aggregate subgradient method for nonsmooth and nonconvex minimization

DOI10.1016/0377-0427(86)90075-0zbMath0603.65042OpenAlexW1979722146MaRDI QIDQ1082780

Krzysztof C. Kiwiel

Publication date: 1986

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(86)90075-0

zbMATH Keywords

global convergencenonsmooth optimizationsubgradient methodnumerical testssubdifferentialdescent methodnondifferentiable programming

Mathematics Subject Classification ID

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

Related Items (3)

The Mordukhovich subdifferentials and directions of descent ⋮ On the problem of minimizing a difference of polyhedral convex functions under linear constraints ⋮ A representation of generalized convex polyhedra and applications

Cites Work

• An aggregate subgradient method for nonsmooth convex minimization
• A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
• On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
• Semismooth and Semiconvex Functions in Constrained Optimization
• A New Approach to Lagrange Multipliers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An aggregate subgradient method for nonsmooth and nonconvex minimization