Proximal Decomposition Via Alternating Linearization
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 9 (3), 668-689
- https://doi.org/10.1137/s1052623495288064
Abstract
A noninterior continuation method is proposed for nonlinear complementarity problems. It improves the noninterior continuation methods recently studied by Burke and Xu [Math. Oper. Res., 23 (1998), pp. 719--734] and Xu [The Global Linear Convergence ...Keywords
This publication has 31 references indexed in Scilit:
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal ControlINFORMS Journal on Computing, 1998
- A parallel descent algorithm for convex programmingComputational Optimization and Applications, 1996
- Scenario analysis via bundle decompositionAnnals of Operations Research, 1995
- A proximal-based decomposition method for convex minimization problemsMathematical Programming, 1994
- Some Saddle-function splitting methods for convex programmingOptimization Methods and Software, 1994
- Convergence of some algorithms for convex minimizationMathematical Programming, 1993
- 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 the Proximal Point Algorithm for Convex MinimizationSIAM Journal on Control and Optimization, 1991
- Numerical methods for nondifferentiable convex optimizationPublished by Springer Science and Business Media LLC ,1987