A variable-penalty alternating directions method for convex optimization
- 1 January 1998
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 83 (1-3) , 29-53
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- A proximal-based decomposition method for convex minimization problemsMathematical Programming, 1994
- Some Reformulations and Applications of the Alternating Direction Method of Multipliers1994
- The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2INFORMS Journal on Computing, 1993
- Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics1989
- On the gradient-projection method for solving the nonsymmetric linear complementarity problemJournal of Optimization Theory and Applications, 1984
- Multipoint methods for separable nonlinear networks1984
- Chapter IX Applications of the Method of Multipliers to Variational Inequalities1983
- Secant approximation methods for convex optimization1981
- Multicommodity network flows—A surveyNetworks, 1978
- Multiplier methods: A surveyAutomatica, 1976