Approximations in proximal bundle methods and decomposition of convex programs
- 1 March 1995
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 84 (3) , 529-548
- https://doi.org/10.1007/bf02191984
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Convex Analysis and Minimization Algorithms IPublished by Springer Nature ,1993
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operatorsMathematical Programming, 1992
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimizationMathematical Programming, 1991
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational InequalitiesSIAM Journal on Control and Optimization, 1991
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programmingMathematical Programming, 1990
- Proximity control in bundle methods for convex nondifferentiable minimizationMathematical Programming, 1990
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problemsApplied Mathematics & Optimization, 1989
- A class of convergent primal-dual subgradient algorithms for decomposable convex programsMathematical Programming, 1986
- Applications of the method of partial inverses to convex programming: DecompositionMathematical Programming, 1985
- Methods of Descent for Nondifferentiable OptimizationLecture Notes in Mathematics, 1985