Journal of Optimization Theory and Applications

, Volume 180, Issue 2, pp 451–479 | Cite as

Optimization for the Sum of Finite Functions Over the Solution Set of Split Equality Optimization Problems with Applications

  • Lai-Jiu LinEmail author


In this paper, we adopt an iterative approach to solve the class of optimization problem for the sum of finite functions over split equality optimization problems for the sum of two functions. This type of problem contains many optimization problems, and bilevel problems, as well as split equality problems, and split feasibility problems as special cases. Here, we are able to establish a strong convergence theorem for an iterative method for solving this problem. As consequences of this convergence theorem, we study the following problems: optimization for the sum of finite functions over the common solution set of optimization problems for the sum of two functions; optimization for the sum of finite functions; optimization for the sum of finite functions with split equality inconsistent feasibility constraints; optimization for the sum of finite functions over the solution set for split equality constrained quadratic signal recovery problem; optimization for the sum of finite functions over the solution set of generalized split equality multiple set feasibility problem, and optimization for the sum of finite functions over the solution set of split equality linear equations problem. We use simultaneous iteration to establish strong convergence theorems for these problems. Our results generalize and improve many existing theorems for these types of problems in the literature and will have applications in nonlinear analysis, optimization problems and signal processing problems.


Optimization for the sum of finite functions Split equality optimization problem Split equality inconsistent feasibility problem Split equality quadratic signal recovery problem 

Mathematics Subject Classification

47H06 47H09 47H10 47J25 65K15 90C35 90C25 



The author wishes to express his gratitude to the referees for their valuable suggestions during the preparation of this paper.


  1. 1.
    Censor, Y., Elfving, T.: A multi projection algorithm using Bregman projection in a product space. Numer. Algorithms 8, 221–239 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Moudafi, A.: A relaxed alternating CQ algorithm for convex feasibility problems. Nonlinear Anal. 79(2013), 117–121 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Chuang, C.S., Yu, Z.T., Lin, L.J.: Mathematical programming for the sum of two convex functions with applications to lasso problems, split feasibility problems and image deblurring problem. Fixed Point Theory Appl. 2015, 143 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Lin, L.J.: Simultaneous iteration for variational inequalities over common solutions for finite families of nonlinear problems. J. Nonlinear Sci. Appl. 11, 394–416 (2018)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Chuang, C.S., Lin, L.J., Yu, Z.T.: Mathematical programming over the solution set of the minimization problem for the sum of two convex functions. J. Nonlinear Convex Anal. 17, 2105–2118 (2016)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Goebel, K., Reich, S.: Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings. Marcel Dekker, New York (1984)zbMATHGoogle Scholar
  7. 7.
    Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, Berlin (2011)CrossRefzbMATHGoogle Scholar
  8. 8.
    Bargetz, C., Reich, S., Zalas, R.: Convergence properties of dynamic string averaging projection methods in the presence of perturbations. Numer. Algorithms 77, 185–209 (2018)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Bailon, J.B., Bruck, R.E., Reich, S.: On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces. Huston J. Math. 4, 1–9 (1978)MathSciNetGoogle Scholar
  10. 10.
    Bruck, R.E., Reich, S.: Nonexpansive projections and resolvents of accretive operators in Banach spaces. Huston J. Math. 3, 459–470 (1977)MathSciNetzbMATHGoogle Scholar
  11. 11.
    Combettes, P.L.: Solving monotone inclusions via compositions of nonexpansive averaged operators. Optimization 53, 475–504 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Wang, Y., Xu, H.K.: Strong convergence for the proximal gradient methods. J. Nonlinear Convex Anal. 15, 581–593 (2014)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Browder, E.E.: Fixed point theorems for noncompact mappings in Hilbert spaces. Proc. Nat. Acad. Sci. USA 53, 1272–1276 (1965)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Ekeland, I., Temam, R.: Convex Analysis and Variational Problems. North Holland Publishing Company, Amsterdam (1976)zbMATHGoogle Scholar
  15. 15.
    Takahashi, W.: Nonlinear Functional Analysis, Fixed Point Theory and Its Applications. Yokohama Publishers, Yokohama (2000)zbMATHGoogle Scholar
  16. 16.
    Lee, G.M., Lin, L.J.: Variational inequalities over split equality fixed point sets of strongly quasinonexpansive mappings with applications. J. Nonlinear Convex Anal. 18, 1781–1800 (2017)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Yu, Z.T., Lin, L.J., Chuang, C.S.: Mathematical programing with multiple sets split monotone variational inclusion constraints. Fixed Point Theory Appl. 2014, 20 (2014)CrossRefzbMATHGoogle Scholar
  18. 18.
    Chang, S.S., Wang, L., Tang, Y.K., Wang, G.: Moudafi’s open question and simultaneous iterative algorithm for general split equality optimization. Fixed Point Theory Appl. 2014, 215 (2014)CrossRefzbMATHGoogle Scholar
  19. 19.
    Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward–backward splitting. Multiscale Model. Simul. 4, 1168–1200 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Censor, Y., Elfving, T., Kopf, N., Bortfeld, T.: The multiple-sets split feasibility problem and its applications for inverse problems. Inverse Probl. 21, 2071–2084 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Combettes, P.L., Bondon, P.: Hard constrained inconsistent signal feasibility problems. IEEE Trans. Signal Process 47, 2460–2468 (1999)CrossRefzbMATHGoogle Scholar
  22. 22.
    Commettes, P.L.: A block-iterative surrogate constraint splitting method for quadratic signal recovery. IEEE Trans. Signal Process 51, 1771–1782 (2003)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Masad, E., Reich, S.: A note on the multiple-set convex set split feasibility problem in Hilbert space. J. Nonlinear Convex Anal. 8, 367–371 (2007)MathSciNetzbMATHGoogle Scholar
  24. 24.
    Xu, H.K.: A variable Krasnosel’skiĭ–Mann algorithm and the multiple-set split feasibility problem. Inverse Probl. 22, 2021–2034 (2006)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of MathematicsNational Changhua University of EducationChanghuaTaiwan

Personalised recommendations