Two-level primal-dual proximal decomposition technique to solve large scale optimization problems

Applied Mathematics and Computation

Volumn 160, Issue 3, 2005, Pages 921-938

  Hamdi, Abdelouahed ^a  

^a KING SAUD UNIVERSITY   (Saudi Arabia)

Author keywords

Decomposition; Multiplier methods; Nonconvex programming; Proximal regularization

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DECOMPOSITION; FUNCTIONS; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION;

GLOBAL OPTIMAL DECISIONS; MULTIPLIER METHODS; NONCONVEX PROGRAMMING; PROXIMAL REGULARIZATION;

PROBLEM SOLVING;

EID: 9544225058     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2003.11.040     Document Type: Article

References (18)

1. A.S. Antipin, On a method for convex programs using a symmetrical modification of the Lagrange function, Ekonomika i Mat. Metody 12 (1976) 1164-1173.
2. D.P. Bertsekas, Convexification procedures and decomposition methods for nonconvex optimization problems, Journal of Optimization Theory and Applications 29 (1979) 169-197.
3. D.P. Bertsekas, Constrained Optimization and Lagrange Multipliers Method, Academic Press, Inc., 1982.
4. D.P. Bertsekas, J.N. Tsitsiklis, Parallel and Distributed Computation, Prentice-Hall Int. Ed., 1989.
5. M. Fukushima, Application of the alternating direction method of multipliers to separable convex programming problems, Computational Optimization and Applications 1 (1992) 92-111.
6. A. Hamdi, P. Mahey, J.P. Dussault, A new decomposition method in nonconvex programming via separable augmented Lagrangians, in: P. Gritzmann, R. Horst, E. Sachs, R. Tichatschke (Eds.), Recent Advances in Optimization, Lecture Notes in Economics and Mathematical Systems, vol. 452, 1997, pp. 90-104.
7. A. Hamdi, P. Mahey, Separable diagonalized multiplier method for decomposing nonlinear programs, Computational and Applied Mathematics 19 (1) (2000) 1-29.
8. M.R. Hestenes, Optimization Theory: The Finite Dimensional Case, John Wiley and Sons, Inc., 1981.
9. L.S. Lasdon, Optimization for Large Systems, Mac Millan, 1970.
10. J.L. Lions, R. Temam, Eclatement et décentralisation en calcul des variations, Lecture Notes in Mathematics 32 (1970) 196-217.
11. P. Mahey, S. Oualibouch, D.T. Pham, Proximal decomposition on the graph of a maximal monotone operator, SIAM Journal on Optimization 5 (2) (1995) 454-466.
12. P. Mahey, J.P. Dussault, A. Benchakroun, A. Hamdi, Adaptive scaling and convergence rates of a separable augmented Lagrangian algorithm, in: V.H. Nguyen, J.J. Strodiot, P. Tossings (Eds.), Lecture Notes in Economics and Mathematical Systems, 1999.
13. R.T. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convex programming, Mathematics of Operations Research 1 (1976) 97-116.
14. J.E. Spingarn, Applications of the method of partial inverse to convex programming decomposition, Mathematical Programming 32 (1985) 199-223.
15. G. Stephanopoulos, A.W. Westerberg, The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization, Journal of Optimization Theory and Applications 15 (1975) 285-309.
16. L. Shin, Complete decomposition algorithm for nonconvex separable optimization problems and applications, Automatica 28 (6) (1992) 1249-1254.
17. A. Tanikawa, H. Mukai, A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem, IEEE Transactions on Automatic Control AC-30 (2) (1985) 133-143.
18. P. Tatjewski, B. Engelmann, Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints, Journal of Optimization Theory and Applications 64 (1) (1990) 183-205.