Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 65, 2016 - Issue 10
269
Views
11
CrossRef citations to date
0
Altmetric
Articles

Adaptive subgradient method for the split quasi-convex feasibility problems

, &
Pages 1885-1898 | Received 28 Aug 2015, Accepted 05 May 2016, Published online: 01 Jun 2016

References

  • Blatt D, Hero AO. Energy-based sensor network source localization via projection onto convex sets. IEEE Trans. Signal Proc. 2006;54:3614–3619.
  • Gholami M, Tetruashvili L, Strom E, et al. Cooperative wireless sensor network positioning via implicit convex feasibility. IEEE Trans. Signal Proc. 2013;61:5830–5840.
  • Carmi A, Censor Y, Gurfil P. Convex feasibility modeling and projection methods for sparse signal recovery. J. Comput. Appl. Math. 2012;236:4318–4335.
  • Combettes PL. The convex feasibility problem in image recovery. In: Hawkes PW, editor. Advances in imaging and electron physics. New York: Elsevier; 1996. p. 155–270.
  • Bauschke HH, Borwein JM. On projection algorithms for solving convex feasibility problems. SIAM Rev. 1996;38:367–426.
  • Censor Y, Segal A. Algorithms for the quasiconvex feasibility problem. J. Comput. Appl. Math. 2006;185:34–50.
  • Frenk JBG, Kassay G. Introduction to convex and quasiconvex analysis. In: Hadjisavvas N, Komlósi S, Schaible S, editors. Handbook of generalized convexity and generalized monotonicity: recent results. New York (NY): Springer; 2005. p. 3–87.
  • Hu YH, Yang XQ, Sim C-K. Inexact subgradient methods for quasi-convex optimization problems. Eur. J. Oper. Res. 2015;240:315–327.
  • Konnov IV. On convergence properties of a subgradient method. Optim. Meth. Software. 2003;18:53–62.
  • Penot J-P. Are generalized derivatives useful for generalized convex functions? In: Crouzeix J-P, Martinez-Legaz JE, Volle M, editors. Generalized convexity, generalized monotonicity: recent results. Dordrecht: Kluwer; 1998. p. 3–59.
  • Penot J-P, Zălinescu C. Elements of quasiconvex subdifferential calculus. J. Convex Anal. 2000;7:243–269.
  • Censor Y, Bortfeld T, Martin B, et al. A unified approach for inversion problems in intensity modulated radiation therapy. Phys. Med. Biol. 2006;51:2353–2365.
  • Censor Y, Elfving T, Kopf N, et al. The multiple-sets split feasibility problem and its applications for inverse problems. Inverse Probl. 2005;21:2071–2084.
  • Censor Y, Elfving T. A multiprojection algorithm using Bregman projections in product space. Numer. Algor. 1994;8:221–239.
  • Byrne CL. Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 2002;18:441–453.
  • Xu HK. Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Probl. 2010;26:105018 (17 pp).
  • Ansari QH, Nimana N, Petrot N. Split hierarchical variational inequality problems and related problems. Fixed Point Theory Appl. 2014;2014:208.
  • Chuang C-S. Algorithms with new parameter conditions for split variational inclusion problems in Hilbert spaces with application to split feasibility problem. Optimization. 2016;65:859–876.
  • He S, Zhao Z, Luo B. A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem. Optimization. 2015;64:1907–1918.
  • Takahashi S, Takahashi W. The split common null point problem and the shrinking projection method in Banach spaces. Optimization. 2016;65:281–287.
  • Wang X, Yang X. On the existence of minimizers of proximity functions for split feasibility problems. J. Optim. Theory Appl. 2015;166:861–888.
  • Greenberg HJ, Pierskalla WP. Quasi-conjugate functions and surrogate duality. Cah. Cent. Étud. Rech. Opér. 1973;15:437–448.
  • Rudin W. Functional analysis. 2nd ed. Singapore: McGraw-Hill; 1991.
  • Rockafellar RT, Wets RJB. Variational analysis. Vol. 317, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Berlin: Springer; 1998.
  • Burachik RS, Iusem AN. Set-valued mapping and enlargements of monotone operators. Vol. 8, Springer optimization and its applications. Berlin: Springer; 2008.
  • Yang Q. The relaxed CQ algorithm for solving the split feasibility problem. Inverse Probl. 2004;20:1261–1266.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.