Proximity control in bundle methods for convex nondifferentiable minimization

Mathematical Programming

Volumn 46, Issue 1-3, 1990, Pages 105-122

  Kiwiel, Krzysztof C ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

convex programming; descent methods; Nondifferentiable minimization; numerical methods

Indexed keywords

MATHEMATICAL PROGRAMMING; SYSTEMS SCIENCE AND CYBERNETICS--OPTIMAL SYSTEMS;

BUNDLE METHODS; CONVEX PROGRAMMING; DESCENT METHODS; NONDIFFERENTIABLE MINIMIZATION; PROXIMAL POINT ALGORITHM;

OPTIMIZATION;

EID: 0025208765     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01585731     Document Type: Article

References (23)

1. Numerical methods for nondifferentiable convex optimizations
2. A subgradient algorithm for certain minimax and minisum problems
3. A descent algorithm for nonsmooth convex programming
4. An aggregate subgradient method for nonsmooth convex minimization
5. An algorithm for linearly constrained convex nondifferentiable minimization problems
6. An exact penalty function method for nonsmooth constrained convex minimization problems
7. A method of linearizations for linearly constrained nonconvex nonsmooth optimization
8. A constraint linearization method for nondifferentiable convex minimization
9. Numerical experiments in nonsmooth optimization
10. Constructing bundle methods for convex optimization
11. A modification and an extension of Lemarechal's algorithm for nonsmooth minimization
12. Monotone operators and the proximal point algorithm
13. A regularized decomposition method for minimizing a sum of polyhedral functions
14. Solution of systems of complex linear equations in the l∞ norm with constraints on the unknowns
15. Nondifferentiable optimization