IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v67y2017i1d10.1007_s10589-016-9884-3.html
   My bibliography  Save this article

Analysis on Newton projection method for the split feasibility problem

Author

Listed:
  • Biao Qu

    (Qufu Normal University)

  • Changyu Wang

    (Qufu Normal University)

  • Naihua Xiu

    (Beijing Jiaotong University)

Abstract

In this paper, based on a merit function of the split feasibility problem (SFP), we present a Newton projection method for solving it and analyze the convergence properties of the method. The merit function is differentiable and convex. But its gradient is a linear composite function of the projection operator, so it is nonsmooth in general. We prove that the sequence of iterates converges globally to a solution of the SFP as long as the regularization parameter matrix in the algorithm is chosen properly. Especially, under some local assumptions which are necessary for the case where the projection operator is nonsmooth, we prove that the sequence of iterates generated by the algorithm superlinearly converges to a regular solution of the SFP. Finally, some numerical results are presented.

Suggested Citation

  • Biao Qu & Changyu Wang & Naihua Xiu, 2017. "Analysis on Newton projection method for the split feasibility problem," Computational Optimization and Applications, Springer, vol. 67(1), pages 175-199, May.
    • Handle: RePEc:spr:coopap:v:67:y:2017:i:1:d:10.1007_s10589-016-9884-3
    DOI: 10.1007/s10589-016-9884-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-016-9884-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-016-9884-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jiming Liu, 1994. "Linear Stability of Generalized Equations Part I: Basic Theory," Mathematics of Operations Research, INFORMS, vol. 19(3), pages 706-720, August.
    2. Zhengyong Zhou & Bo Yu, 2014. "A smoothing homotopy method for variational inequality problems on polyhedral convex sets," Journal of Global Optimization, Springer, vol. 58(1), pages 151-168, January.
    3. Changyu Wang & Qian Liu & Cheng Ma, 2013. "Smoothing SQP algorithm for semismooth equations with box constraints," Computational Optimization and Applications, Springer, vol. 55(2), pages 399-425, June.
    4. Paul Armand & Joël Benoist & Riadh Omheni & Vincent Pateloup, 2014. "Study of a primal-dual algorithm for equality constrained minimization," Computational Optimization and Applications, Springer, vol. 59(3), pages 405-433, December.
    5. Qu, Biao & Liu, Binghua & Zheng, Na, 2015. "On the computation of the step-size for the CQ-like algorithms for the split feasibility problem," Applied Mathematics and Computation, Elsevier, vol. 262(C), pages 218-223.
    6. Stephen M. Robinson, 1980. "Strongly Regular Generalized Equations," Mathematics of Operations Research, INFORMS, vol. 5(1), pages 43-62, February.
    7. Dong-Hui Li & Masao Fukushima, 2001. "Globally Convergent Broyden-Like Methods for Semismooth Equations and Applications to VIP, NCP and MCP," Annals of Operations Research, Springer, vol. 103(1), pages 71-97, March.
    8. Jiming Liu, 1994. "Linear Stability of Generalized Equations, Part II: Applications to Nonlinear Programming," Mathematics of Operations Research, INFORMS, vol. 19(3), pages 721-742, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Qiao-Li Dong & Songnian He & Michael Th. Rassias, 2021. "General splitting methods with linearization for the split feasibility problem," Journal of Global Optimization, Springer, vol. 79(4), pages 813-836, April.
    2. Li-Jun Zhu & Yonghong Yao, 2019. "An Iterative Approach to the Solutions of Proximal Split Feasibility Problems," Mathematics, MDPI, vol. 7(2), pages 1-9, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. M. Durea & R. Strugariu, 2011. "On parametric vector optimization via metric regularity of constraint systems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 409-425, December.
    2. Fabiana R. Oliveira & Orizon P. Ferreira & Gilson N. Silva, 2019. "Newton’s method with feasible inexact projections for solving constrained generalized equations," Computational Optimization and Applications, Springer, vol. 72(1), pages 159-177, January.
    3. Sanja Rapajić & Zoltan Papp, 2017. "A nonmonotone Jacobian smoothing inexact Newton method for NCP," Computational Optimization and Applications, Springer, vol. 66(3), pages 507-532, April.
    4. Nguyen Qui, 2014. "Stability for trust-region methods via generalized differentiation," Journal of Global Optimization, Springer, vol. 59(1), pages 139-164, May.
    5. Michael Patriksson & R. Tyrrell Rockafellar, 2003. "Sensitivity Analysis of Aggregated Variational Inequality Problems, with Application to Traffic Equilibria," Transportation Science, INFORMS, vol. 37(1), pages 56-68, February.
    6. J. V. Outrata, 1999. "Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints," Mathematics of Operations Research, INFORMS, vol. 24(3), pages 627-644, August.
    7. A. L. Dontchev, 1998. "A Proof of the Necessity of Linear Independence Condition and Strong Second-Order Sufficient Optimality Condition for Lipschitzian Stability in Nonlinear Programming," Journal of Optimization Theory and Applications, Springer, vol. 98(2), pages 467-473, August.
    8. B. S. Mordukhovich & M. E. Sarabi, 2016. "Second-Order Analysis of Piecewise Linear Functions with Applications to Optimization and Stability," Journal of Optimization Theory and Applications, Springer, vol. 171(2), pages 504-526, November.
    9. Huynh Van Ngai & Nguyen Huu Tron & Michel Théra, 2014. "Metric Regularity of the Sum of Multifunctions and Applications," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 355-390, February.
    10. Jie Jiang & Xiaojun Chen & Zhiping Chen, 2020. "Quantitative analysis for a class of two-stage stochastic linear variational inequality problems," Computational Optimization and Applications, Springer, vol. 76(2), pages 431-460, June.
    11. Birbil, S.I. & Gürkan, G. & Listeş, O., 2004. "Simulation-based solution of stochastic mathematical programs with complementarity constraints: Sample-path analysis," ERIM Report Series Research in Management ERS-2004-016-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    12. A. F. Izmailov & M. V. Solodov, 2023. "Convergence rate estimates for penalty methods revisited," Computational Optimization and Applications, Springer, vol. 85(3), pages 973-992, July.
    13. B. S. Mordukhovich & M. E. Sarabi, 2017. "Stability Analysis for Composite Optimization Problems and Parametric Variational Systems," Journal of Optimization Theory and Applications, Springer, vol. 172(2), pages 554-577, February.
    14. Renke Kuhlmann & Christof Büskens, 2018. "A primal–dual augmented Lagrangian penalty-interior-point filter line search algorithm," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(3), pages 451-483, June.
    15. Jin Zhang & Xide Zhu, 2022. "Linear Convergence of Prox-SVRG Method for Separable Non-smooth Convex Optimization Problems under Bounded Metric Subregularity," Journal of Optimization Theory and Applications, Springer, vol. 192(2), pages 564-597, February.
    16. Nguyen Thanh Qui, 2012. "Nonlinear Perturbations of Polyhedral Normal Cone Mappings and Affine Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 153(1), pages 98-122, April.
    17. Jong-Shi Pang & Defeng Sun & Jie Sun, 2003. "Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 39-63, February.
    18. Houduo Qi, 2009. "Local Duality of Nonlinear Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 124-141, February.
    19. Boris Mordukhovich, 2015. "Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 35-42, April.
    20. Diethard Klatte & Bernd Kummer, 2013. "Aubin property and uniqueness of solutions in cone constrained optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 77(3), pages 291-304, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:67:y:2017:i:1:d:10.1007_s10589-016-9884-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.