Decomposition algorithm for convex differentiable minimization
Author:
- 1 July 1991
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 70 (1) , 109-135
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational InequalitiesSIAM Journal on Control and Optimization, 1991
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified ApproachSIAM Journal on Control and Optimization, 1990
- Relaxation Methods for Network Flow Problems with Convex Arc CostsSIAM Journal on Control and Optimization, 1987
- Iterative Methods for Large Convex Quadratic Programs: A SurveySIAM Journal on Control and Optimization, 1987
- Projection methods for variational inequalities with application to the traffic assignment problem1982
- A scaled reduced gradient algorithm for network flow problems with convex separable costs1981
- Splitting Algorithms for the Sum of Two Nonlinear OperatorsSIAM Journal on Numerical Analysis, 1979
- Monotone Operators and the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1976
- Convex programming in Hilbert spaceBulletin of the American Mathematical Society, 1964
- A convex programming procedureNaval Research Logistics Quarterly, 1959