Proximity control in bundle methods for convex nondifferentiable minimization
- 1 January 1990
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 46 (1-3), 105-122
- https://doi.org/10.1007/bf01585731
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A constraint linearization method for nondifferentiable convex minimizationNumerische Mathematik, 1987
- Numerical methods for nondifferentiable convex optimizationPublished by Springer Science and Business Media LLC ,1987
- A method of linearizations for linearly constrained nonconvex nonsmooth minimizationMathematical Programming, 1986
- Constructing Bundle Methods for Convex OptimizationPublished by Elsevier BV ,1986
- An algorithm for linearly constrained convex nondifferentiable minimization problemsJournal of Mathematical Analysis and Applications, 1985
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization ProblemsIMA Journal of Numerical Analysis, 1985
- A descent algorithm for nonsmooth convex optimizationMathematical Programming, 1984
- An aggregate subgradient method for nonsmooth convex minimizationMathematical Programming, 1983
- A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained CaseSIAM Journal on Control and Optimization, 1982
- Test Examples for Nonlinear Programming CodesLecture Notes in Economics and Mathematical Systems, 1981