Skip to main content
Top

2020 | OriginalPaper | Chapter

Adaptive Descent Splitting Method for Decomposable Optimization Problems

Authors : Igor Konnov, Olga Pinyagina

Published in: Mathematical Optimization Theory and Operations Research

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

We suggest a modified descent splitting method for optimization problems having a special decomposable structure. The proposed modification maintains the basic convergence properties but enables one to reduce computational efforts per iteration and to provide computations in a distributed manner. On the one hand, it consists in component-wise choice of descent directions together with a special threshold control. On the other hand, it involves a simple adaptive step-size choice, which takes into account the problem behavior along the iteration sequence. Preliminary computational tests confirm the efficiency of the proposed modification.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two monotone operators. SIAM. J. Num. Anal. 16(6), 964–979 (1979)CrossRef Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two monotone operators. SIAM. J. Num. Anal. 16(6), 964–979 (1979)CrossRef
2.
go back to reference Gabay, D.: Application of the method of multipliers to variational inequalities. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-value Problems, pp. 299–331. North-Holland, Amsterdam (1983)CrossRef Gabay, D.: Application of the method of multipliers to variational inequalities. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-value Problems, pp. 299–331. North-Holland, Amsterdam (1983)CrossRef
3.
go back to reference Fukushima, M., Mine, H.: A generalized proximal point algorithm for certain non-convex minimization problems. Int. J. Syst. Sci. 12, 989–1000 (1981)CrossRef Fukushima, M., Mine, H.: A generalized proximal point algorithm for certain non-convex minimization problems. Int. J. Syst. Sci. 12, 989–1000 (1981)CrossRef
4.
go back to reference Patriksson, M.: Cost approximations: a unified framework of descent algorithms for nonlinear programs. SIAM J. Optim. 8(2), 561–582 (1998)MathSciNetCrossRef Patriksson, M.: Cost approximations: a unified framework of descent algorithms for nonlinear programs. SIAM J. Optim. 8(2), 561–582 (1998)MathSciNetCrossRef
5.
go back to reference Patriksson, M.: Nonlinear Programming and Variational Inequality Problems: A Unified Approach. Kluwer, Dordrecht (1999)CrossRef Patriksson, M.: Nonlinear Programming and Variational Inequality Problems: A Unified Approach. Kluwer, Dordrecht (1999)CrossRef
6.
go back to reference Konnov, I.V., Kum, S.: Descent methods for mixed variational inequalities in a Hilbert space. Nonlinear Anal. Theory Methods Appl. 47(1), 561–572 (2001)MathSciNetCrossRef Konnov, I.V., Kum, S.: Descent methods for mixed variational inequalities in a Hilbert space. Nonlinear Anal. Theory Methods Appl. 47(1), 561–572 (2001)MathSciNetCrossRef
7.
go back to reference Konnov, I.V.: Iterative solution methods for mixed equilibrium problems and variational inequalities with non-smooth functions. In: Haugen, I.N., Nilsen, A.S. (eds.) Game Theory: Strategies, Equilibria, and Theorems, pp. 117–160. NOVA, Hauppauge (2008) Konnov, I.V.: Iterative solution methods for mixed equilibrium problems and variational inequalities with non-smooth functions. In: Haugen, I.N., Nilsen, A.S. (eds.) Game Theory: Strategies, Equilibria, and Theorems, pp. 117–160. NOVA, Hauppauge (2008)
8.
go back to reference Konnov, I.V.: Descent methods for mixed variational inequalities with non-smooth mappings. In: Reich, S., Zaslavski, A.J. (eds.) Optimization Theory and Related Topics. Contemporary Mathematics, vol. 568, pp. 121–138 (2012). Amer. Math. Soc., Providence Konnov, I.V.: Descent methods for mixed variational inequalities with non-smooth mappings. In: Reich, S., Zaslavski, A.J. (eds.) Optimization Theory and Related Topics. Contemporary Mathematics, vol. 568, pp. 121–138 (2012). Amer. Math. Soc., Providence
9.
go back to reference Konnov, I.V.: Salahuddin: two-level iterative method for non-stationary mixed variational inequalities. Russ. Math. (Iz. VUZ) 61(10), 44–53 (2017)CrossRef Konnov, I.V.: Salahuddin: two-level iterative method for non-stationary mixed variational inequalities. Russ. Math. (Iz. VUZ) 61(10), 44–53 (2017)CrossRef
10.
go back to reference Konnov, I.V.: Sequential threshold control in descent splitting methods for decomposable optimization problems. Optim. Methods Softw. 30(6), 1238–1254 (2015)MathSciNetCrossRef Konnov, I.V.: Sequential threshold control in descent splitting methods for decomposable optimization problems. Optim. Methods Softw. 30(6), 1238–1254 (2015)MathSciNetCrossRef
11.
go back to reference Konnov, I.: Conditional gradient method without line-search. Russ. Math. 62(1), 82–85 (2018)CrossRef Konnov, I.: Conditional gradient method without line-search. Russ. Math. 62(1), 82–85 (2018)CrossRef
12.
go back to reference Konnov, I.: A simple adaptive step-size choice for iterative optimization methods. Adv. Model. Optim. 20(2), 353–369 (2018)MathSciNetMATH Konnov, I.: A simple adaptive step-size choice for iterative optimization methods. Adv. Model. Optim. 20(2), 353–369 (2018)MathSciNetMATH
Metadata
Title
Adaptive Descent Splitting Method for Decomposable Optimization Problems
Authors
Igor Konnov
Olga Pinyagina
Copyright Year
2020
DOI
https://doi.org/10.1007/978-3-030-49988-4_9

Premium Partner