We propose a convergence analysis of a new decomposition method to solve structured optimization problems. The proposed scheme is based on a class of modified Lagrangians combined with the allocation of resources decomposition algorithm. Under mild assumptions, we show that the method generates convergent primal-dual sequences.

## References

J. E. Eckstein, “Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming,” Working Paper 91-004, Harvard Business School, 1990. J. E. Eckstein, “Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming,” Working Paper 91-004, Harvard Business School, 1990.

R. Polyak and M. Teboulle, “Nonlinear rescaling and proximal-like methods in convex optimization,”

*Mathematical Programming*, vol. 76, no. 2, pp. 265–284, 1997. 0882.90106 MR1427187 R. Polyak and M. Teboulle, “Nonlinear rescaling and proximal-like methods in convex optimization,”*Mathematical Programming*, vol. 76, no. 2, pp. 265–284, 1997. 0882.90106 MR1427187 J. E. Spingarn, “Applications of the method of partial inverses to convex programming: decomposition,”

*Mathematical Programming*, vol. 32, no. 2, pp. 199–223, 1985. 0565.90058 MR793690 10.1007/BF01586091 J. E. Spingarn, “Applications of the method of partial inverses to convex programming: decomposition,”*Mathematical Programming*, vol. 32, no. 2, pp. 199–223, 1985. 0565.90058 MR793690 10.1007/BF01586091 R. S. Burachik, C. Sagastizábal, and S. Scheimberg, “An inexact method of partial inverses and a parallel bundle method,”

*Optimization Methods & Software*, vol. 21, no. 3, pp. 385–400, 2006. 1091.49006 MR2197503 R. S. Burachik, C. Sagastizábal, and S. Scheimberg, “An inexact method of partial inverses and a parallel bundle method,”*Optimization Methods & Software*, vol. 21, no. 3, pp. 385–400, 2006. 1091.49006 MR2197503 J. Eckstein, “Parallel alternating direction multiplier decomposition of convex programs,”

*Journal of Optimization Theory and Applications*, vol. 80, no. 1, pp. 39–62, 1994. 0797.90075 MR1256136 10.1007/BF02196592 J. Eckstein, “Parallel alternating direction multiplier decomposition of convex programs,”*Journal of Optimization Theory and Applications*, vol. 80, no. 1, pp. 39–62, 1994. 0797.90075 MR1256136 10.1007/BF02196592 M. Fukushima, “Application of the alternating direction method of multipliers to separable convex programming problems,”

*Computational Optimization and Applications*, vol. 1, no. 1, pp. 93–111, 1992. 0763.90071 MR1195631 10.1007/BF00247655 M. Fukushima, “Application of the alternating direction method of multipliers to separable convex programming problems,”*Computational Optimization and Applications*, vol. 1, no. 1, pp. 93–111, 1992. 0763.90071 MR1195631 10.1007/BF00247655 D. Gabay and B. Mercier, “A dual algorithm for the solution of nonlinear variational problems via finite element approximation,”

*Computers and Mathematics with Applications*, vol. 2, no. 1, pp. 17–40, 1976. 0352.65034 D. Gabay and B. Mercier, “A dual algorithm for the solution of nonlinear variational problems via finite element approximation,”*Computers and Mathematics with Applications*, vol. 2, no. 1, pp. 17–40, 1976. 0352.65034 A. Hamdi, P. Mahey, and J. P. Dussault, “A new decomposition method in nonconvex programming via a separable augmented Lagrangian,” in

*Recent Advances in Optimization*, P. Gritzmann, R. Horst, E. Sachs, and R. Tichatschke, Eds., vol. 452 of*Lecture Notes in Economics and Mathematical Systems*, pp. 90–104, Springer, Berlin, Germany, 1997. 0882.65055 MR1467023 10.1007/978-3-642-59073-3_7 A. Hamdi, P. Mahey, and J. P. Dussault, “A new decomposition method in nonconvex programming via a separable augmented Lagrangian,” in*Recent Advances in Optimization*, P. Gritzmann, R. Horst, E. Sachs, and R. Tichatschke, Eds., vol. 452 of*Lecture Notes in Economics and Mathematical Systems*, pp. 90–104, Springer, Berlin, Germany, 1997. 0882.65055 MR1467023 10.1007/978-3-642-59073-3_7 A. Hamdi and P. Mahey, “Separable diagonalized multiplier method for decomposing nonlinear programs,”

*Computational & Applied Mathematics*, vol. 19, no. 1, pp. 1–29, 2000. MR1994675 A. Hamdi and P. Mahey, “Separable diagonalized multiplier method for decomposing nonlinear programs,”*Computational & Applied Mathematics*, vol. 19, no. 1, pp. 1–29, 2000. MR1994675 A. Hamdi, “Two-level primal-dual proximal decomposition technique to solve large scale optimization problems,”

*Applied Mathematics and Computation*, vol. 160, no. 3, pp. 921–938, 2005. 1122.90061 MR2113127 10.1016/j.amc.2003.11.040 A. Hamdi, “Two-level primal-dual proximal decomposition technique to solve large scale optimization problems,”*Applied Mathematics and Computation*, vol. 160, no. 3, pp. 921–938, 2005. 1122.90061 MR2113127 10.1016/j.amc.2003.11.040 P. Mahey, S. Oualibouch, and Pham Dinh Tao, “Proximal decomposition on the graph of a maximal monotone operator,”

*SIAM Journal on Optimization*, vol. 5, no. 2, pp. 454–466, 1995. 0834.90105 MR1330206 10.1137/0805023 P. Mahey, S. Oualibouch, and Pham Dinh Tao, “Proximal decomposition on the graph of a maximal monotone operator,”*SIAM Journal on Optimization*, vol. 5, no. 2, pp. 454–466, 1995. 0834.90105 MR1330206 10.1137/0805023 R. T. Rockafellar, “Augmented Lagrangians and applications of the proximal point algorithm in convex programming,”

*Mathematics of Operations Research*, vol. 1, no. 2, pp. 97–116, 1976. 0402.90076 MR418919 10.1287/moor.1.2.97 R. T. Rockafellar, “Augmented Lagrangians and applications of the proximal point algorithm in convex programming,”*Mathematics of Operations Research*, vol. 1, no. 2, pp. 97–116, 1976. 0402.90076 MR418919 10.1287/moor.1.2.97 A. N. Iusem and M. Teboulle, “Convergence rate analysis of nonquadratic proximal methods for convex and linear programming,”

*Mathematics of Operations Research*, vol. 20, no. 3, pp. 657–677, 1995. 0845.90099 MR1354775 10.1287/moor.20.3.657 A. N. Iusem and M. Teboulle, “Convergence rate analysis of nonquadratic proximal methods for convex and linear programming,”*Mathematics of Operations Research*, vol. 20, no. 3, pp. 657–677, 1995. 0845.90099 MR1354775 10.1287/moor.20.3.657 K. C. Kiwiel, “Proximal minimization methods with generalized Bregman functions,”

*SIAM Journal on Control and Optimization*, vol. 35, no. 4, pp. 1142–1168, 1997. 0890.65061 MR1453294 10.1137/S0363012995281742 K. C. Kiwiel, “Proximal minimization methods with generalized Bregman functions,”*SIAM Journal on Control and Optimization*, vol. 35, no. 4, pp. 1142–1168, 1997. 0890.65061 MR1453294 10.1137/S0363012995281742 R. A. Polyak, “Log-sigmoid multipliers method in constrained optimization,”

*Annals of Operations Research*, vol. 101, pp. 427–460, 2001. 0996.90088 MR1852524 10.1023/A:1010938423538 R. A. Polyak, “Log-sigmoid multipliers method in constrained optimization,”*Annals of Operations Research*, vol. 101, pp. 427–460, 2001. 0996.90088 MR1852524 10.1023/A:1010938423538 M. Teboulle, “Entropic proximal mappings with applications to nonlinear programming,”

*Mathematics of Operations Research*, vol. 17, no. 3, pp. 670–690, 1992. 0766.90071 MR1177730 10.1287/moor.17.3.670 M. Teboulle, “Entropic proximal mappings with applications to nonlinear programming,”*Mathematics of Operations Research*, vol. 17, no. 3, pp. 670–690, 1992. 0766.90071 MR1177730 10.1287/moor.17.3.670 M. Teboulle, “Convergence of proximal-like algorithms,”

*SIAM Journal on Optimization*, vol. 7, no. 4, pp. 1069–1083, 1997. 0890.90151 MR1479615 10.1137/S1052623495292130 M. Teboulle, “Convergence of proximal-like algorithms,”*SIAM Journal on Optimization*, vol. 7, no. 4, pp. 1069–1083, 1997. 0890.90151 MR1479615 10.1137/S1052623495292130 O. M. Guèye, J.-P. Dussault, and P. Mahey, “Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming,”

*Journal of Optimization Theory and Applications*, vol. 127, no. 2, pp. 329–345, 2005. 1116.90105 MR2186127 10.1007/s10957-005-6547-4 O. M. Guèye, J.-P. Dussault, and P. Mahey, “Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming,”*Journal of Optimization Theory and Applications*, vol. 127, no. 2, pp. 329–345, 2005. 1116.90105 MR2186127 10.1007/s10957-005-6547-4 A. Auslender and M. Teboulle, “Entropic proximal decomposition methods for convex programs and variational inequalities,”

*Mathematical Programming*, vol. 91, no. 1, pp. 33–47, 2001. 1051.90017 MR1865260 A. Auslender and M. Teboulle, “Entropic proximal decomposition methods for convex programs and variational inequalities,”*Mathematical Programming*, vol. 91, no. 1, pp. 33–47, 2001. 1051.90017 MR1865260 A. Auslender, M. Teboulle, and S. Ben-Tiba, “A logarithmic-quadratic proximal method for variational inequalities,”

*Computational Optimization and Applications*, vol. 12, no. 1–3, pp. 31–40, 1999. 1039.90529 MR1704099 10.1023/A:1008607511915 A. Auslender, M. Teboulle, and S. Ben-Tiba, “A logarithmic-quadratic proximal method for variational inequalities,”*Computational Optimization and Applications*, vol. 12, no. 1–3, pp. 31–40, 1999. 1039.90529 MR1704099 10.1023/A:1008607511915 A. Auslender, M. Teboulle, and S. Ben-Tiba, “Interior proximal and multiplier methods based on second order homogeneous kernels,”

*Mathematics of Operations Research*, vol. 24, no. 3, pp. 645–668, 1999. 1039.90518 MR1854247 10.1287/moor.24.3.645 A. Auslender, M. Teboulle, and S. Ben-Tiba, “Interior proximal and multiplier methods based on second order homogeneous kernels,”*Mathematics of Operations Research*, vol. 24, no. 3, pp. 645–668, 1999. 1039.90518 MR1854247 10.1287/moor.24.3.645 G. Chen and M. Teboulle, “A proximal-based decomposition method for convex minimization problems,”

*Mathematical Programming*, vol. 64, no. 1, pp. 81–101, 1994. MR1274173 10.1007/BF01582566 G. Chen and M. Teboulle, “A proximal-based decomposition method for convex minimization problems,”*Mathematical Programming*, vol. 64, no. 1, pp. 81–101, 1994. MR1274173 10.1007/BF01582566 M. Kyono and M. Fukushima, “Nonlinear proximal decomposition method for convex programming,”

*Journal of Optimization Theory and Applications*, vol. 106, no. 2, pp. 357–372, 2000. 0982.90036 MR1788929 10.1023/A:1004655531273 M. Kyono and M. Fukushima, “Nonlinear proximal decomposition method for convex programming,”*Journal of Optimization Theory and Applications*, vol. 106, no. 2, pp. 357–372, 2000. 0982.90036 MR1788929 10.1023/A:1004655531273 M. Aslam Noor, “Some developments in general variational inequalities,”

*Applied Mathematics and Computation*, vol. 152, no. 1, pp. 199–277, 2004. 1134.49304 MR2050063 10.1016/S0096-3003(03)00558-7 M. Aslam Noor, “Some developments in general variational inequalities,”*Applied Mathematics and Computation*, vol. 152, no. 1, pp. 199–277, 2004. 1134.49304 MR2050063 10.1016/S0096-3003(03)00558-7 M. A. Noor, “Extended general variational inequalities,”

*Applied Mathematics Letters*, vol. 22, no. 2, pp. 182–186, 2009. 1163.49303 MR2482273 10.1016/j.aml.2008.03.007 M. A. Noor, “Extended general variational inequalities,”*Applied Mathematics Letters*, vol. 22, no. 2, pp. 182–186, 2009. 1163.49303 MR2482273 10.1016/j.aml.2008.03.007 M. A. Noor, K. I. Noor, and E. Al-said, “Iterative methods for solving nonconvex equilibrium problems,”

*Applied Mathematics and Information Science*, vol. 6, no. 1, pp. 65–69, 2012. MR2916790 M. A. Noor, K. I. Noor, and E. Al-said, “Iterative methods for solving nonconvex equilibrium problems,”*Applied Mathematics and Information Science*, vol. 6, no. 1, pp. 65–69, 2012. MR2916790 A. Hamdi, “Decomposition for structured convex programs with smooth multiplier methods,”

*Applied Mathematics and Computation*, vol. 169, no. 1, pp. 218–241, 2005. 1091.65056 MR2169144 10.1016/j.amc.2004.10.079 A. Hamdi, “Decomposition for structured convex programs with smooth multiplier methods,”*Applied Mathematics and Computation*, vol. 169, no. 1, pp. 218–241, 2005. 1091.65056 MR2169144 10.1016/j.amc.2004.10.079 P. Mahey, A. Ouorou, L. LeBlanc, and J. Chifflet, “A new proximal decomposition algorithm for routing in telecommunication networks,”

*Networks*, vol. 31, no. 4, pp. 227–238, 1998. 1015.90020 P. Mahey, A. Ouorou, L. LeBlanc, and J. Chifflet, “A new proximal decomposition algorithm for routing in telecommunication networks,”*Networks*, vol. 31, no. 4, pp. 227–238, 1998. 1015.90020 J. M. Mulvey and A. Ruszczyński, “A diagonal quadratic approximation method for large-scale linear programs,”

*Operations Research Letters*, vol. 12, no. 4, pp. 205–215, 1992. 0767.90047 MR1186794 10.1016/0167-6377(92)90046-6 J. M. Mulvey and A. Ruszczyński, “A diagonal quadratic approximation method for large-scale linear programs,”*Operations Research Letters*, vol. 12, no. 4, pp. 205–215, 1992. 0767.90047 MR1186794 10.1016/0167-6377(92)90046-6 G. Stephanopoulos and A. W. Westerberg, “The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization,”

*Journal of Optimization Theory and Applications*, vol. 15, pp. 285–309, 1975. 0278.49040 MR378833 10.1007/BF00933339 G. Stephanopoulos and A. W. Westerberg, “The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization,”*Journal of Optimization Theory and Applications*, vol. 15, pp. 285–309, 1975. 0278.49040 MR378833 10.1007/BF00933339 A. Tanikawa and H. Mukai, “A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem,”

*IEEE on Transactions on Automatic Control*, vol. 30, no. 2, pp. 133–143, 1985. 0553.90087 MR778632 10.1109/TAC.1985.1103899 A. Tanikawa and H. Mukai, “A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem,”*IEEE on Transactions on Automatic Control*, vol. 30, no. 2, pp. 133–143, 1985. 0553.90087 MR778632 10.1109/TAC.1985.1103899 A. Ben-Tal and M. Zibulevsky, “Penalty/barrier multiplier methods for convex programming problems,”

*SIAM Journal on Optimization*, vol. 7, no. 2, pp. 347–366, 1997. 0872.90068 MR1443623 10.1137/S1052623493259215 A. Ben-Tal and M. Zibulevsky, “Penalty/barrier multiplier methods for convex programming problems,”*SIAM Journal on Optimization*, vol. 7, no. 2, pp. 347–366, 1997. 0872.90068 MR1443623 10.1137/S1052623493259215 R. Polyak and I. Griva, “Primal-dual nonlinear rescaling method for convex optimization,”

*Journal of Optimization Theory and Applications*, vol. 122, no. 1, pp. 111–156, 2004. 1129.90339 MR2092474 10.1023/B:JOTA.0000041733.24606.99 R. Polyak and I. Griva, “Primal-dual nonlinear rescaling method for convex optimization,”*Journal of Optimization Theory and Applications*, vol. 122, no. 1, pp. 111–156, 2004. 1129.90339 MR2092474 10.1023/B:JOTA.0000041733.24606.99 R. Polyak, “Nonlinear Rescaling as Interior Quadratic Prox Method in Convex Optimization,”

*Journal Computational Optimization and Applications*, vol. 35, no. 3, pp. 347–373, 2006. MR2279496 10.1007/s10589-006-9759-0 R. Polyak, “Nonlinear Rescaling as Interior Quadratic Prox Method in Convex Optimization,”*Journal Computational Optimization and Applications*, vol. 35, no. 3, pp. 347–373, 2006. MR2279496 10.1007/s10589-006-9759-0 A. Auslender, R. Cominetti, and M. Haddou, “Asymptotic analysis for penalty and barrier methods in convex and linear programming,”

*Mathematics of Operations Research*, vol. 22, no. 1, pp. 43–62, 1997. 0872.90067 MR1436573 10.1287/moor.22.1.43 A. Auslender, R. Cominetti, and M. Haddou, “Asymptotic analysis for penalty and barrier methods in convex and linear programming,”*Mathematics of Operations Research*, vol. 22, no. 1, pp. 43–62, 1997. 0872.90067 MR1436573 10.1287/moor.22.1.43 A. Auslender and M. Teboulle,

*Asymptotic Cones and Functions in Optimization and Variational Inequalities*, Springer, 2003. MR1931309 1037.68762 A. Auslender and M. Teboulle,*Asymptotic Cones and Functions in Optimization and Variational Inequalities*, Springer, 2003. MR1931309 1037.68762