Decomposition method of descent for minimizing the sum of convex nonsmooth functions

DOI10.1007/BF00941285zbMath0585.90072OpenAlexW2001960357MaRDI QIDQ1071652

Krzysztof C. Kiwiel

Publication date: 1987

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

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

zbMATH Keywords

decompositionnondifferentiable optimizationdescent methoddual block-angular structurelarge-scale linear programssum of possibly nonsmooth convex functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Decomposition methods (49M27) Methods of successive quadratic programming type (90C55)

Related Items (1)

The proximal Chebychev center cutting plane algorithm for convex additive functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial inverse of a monotone operator
• An aggregate subgradient method for nonsmooth convex minimization
• Decomposition through formalization in a product space
• A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
• Large-scale linearly constrained optimization
• Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions

This page was built for publication: Decomposition method of descent for minimizing the sum of convex nonsmooth functions