A subgradient selection method for minimizing convex functions subject to linear constraints

DOI10.1007/BF02239973zbMath0627.65074OpenAlexW1576908875MaRDI QIDQ1092621

Krzysztof C. Kiwiel

Publication date: 1987

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

convergenceconvex programmingnondifferentiable optimizationlinearly constrained optimizationsubgradient algorithm

Mathematics Subject Classification ID

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

Cites Work

• An algorithm for linearly constrained convex nondifferentiable minimization problems
• An aggregate subgradient method for nonsmooth convex minimization
• The Cutting-Plane Method for Solving Convex Programs
• A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
• ε-Optimal solutions in nondifferentiable convex programming and some related questions
• An Algorithm for Constrained Optimization with Semismooth Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A subgradient selection method for minimizing convex functions subject to linear constraints