A proximal-based decomposition method for convex minimization problems
- 1 March 1994
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 64 (1-3) , 81-101
- https://doi.org/10.1007/bf01582566
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Application of the alternating direction method of multipliers to separable convex programming problemsComputational Optimization and Applications, 1992
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operatorsMathematical Programming, 1992
- On the convergence of Han's method for convex programming with quadratic objectiveMathematical Programming, 1991
- On the Convergence of the Proximal Point Algorithm for Convex MinimizationSIAM Journal on Control and Optimization, 1991
- A Parallel Algorithm for a Class of Convex ProgramsSIAM Journal on Control and Optimization, 1988
- Numerical methods for nondifferentiable convex optimizationPublished by Springer Nature ,1987
- Chapter IX Applications of the Method of Multipliers to Variational InequalitiesPublished by Elsevier ,1983
- Splitting Algorithms for the Sum of Two Nonlinear OperatorsSIAM Journal on Numerical Analysis, 1979
- A dual algorithm for the solution of nonlinear variational problems via finite element approximationComputers & Mathematics with Applications, 1976
- Sur l'approximation, par éléments finis d'ordre un, et la résolution, par pénalisation-dualité d'une classe de problèmes de Dirichlet non linéairesRevue française d'automatique, informatique, recherche opérationnelle. Analyse numérique, 1975