Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications

  • Published:
Computational and Applied Mathematics Aims and scope Submit manuscript

Abstract

In this paper, based on the inertial acceleration technique, we propose a family of inertial derivative-free projection methods for solving nonlinear pseudo-monotone equations with convex constraints, in which the search direction is only required to satisfy the sufficient descent condition. The global convergence of the family is established without the Lipschitz continuity of the underlying mapping. To the best of our knowledge, this is the first convergence result for inertial-type algorithms in the pseudo-monotone scenario, and it is also very few for the monotone scenario in the literature since the well-established condition to ensure convergence in this scenario is replaced with a weaker one. Moreover, we propose an inertial derivative-free projection method by embedding a specific search direction into the family. Our numerical experiments on the standard constrained nonlinear equations illustrate the effectiveness and efficiency of the proposed method compared with two state-of-the-art methods. Finally, applying it to solve the regularized decentralized logistic regression shows that our method is quite promising.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. All codes are available at https://github.com/jhyin-optim/FIDFPMs_MATLABcodes.

References

  • Abubakar AB, Kumam P (2019) A descent Dai–Liao conjugate gradient method for nonlinear equations. Numer Algor 81(1):197–210

    Article  MathSciNet  Google Scholar 

  • Abubakar AB, Kumam P, Ibrahim AH (2021) Inertial derivative-free projection method for nonlinear monotone operator equations with convex constraints. IEEE Access 9:92157–92167

    Article  Google Scholar 

  • Alvarez F (2000) On the minimizing property of a second order dissipative system in Hilbert spaces. SIAM J Control Optim 38(4):1102–1119

    Article  MathSciNet  Google Scholar 

  • Alvarez F (2004) Weak convergence of a relaxed and inertial hybrid projection-proximal point algorithm for maximal monotone operators in Hilbert space. SIAM J Optim 14(3):773–782

    Article  MathSciNet  Google Scholar 

  • Alvarez F, Attouch H (2001) An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set-Valued Anal 9(1):3–11

    Article  MathSciNet  Google Scholar 

  • Awwal AM, Kumam P, Mohammad H et al (2021) A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing \(\ell _1\) regularized problem. Optimization 70(5–6):1231–1259

    Article  MathSciNet  Google Scholar 

  • Boyd S, Parikh N, Chu E et al (2011) Distributed optimization and statistical learning with the alternating direction method of multipliers. Found Trends Mach Learn 3(1):1–122

    Article  Google Scholar 

  • Byrne C (2004) A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl 20(1):103–120

    Article  MathSciNet  Google Scholar 

  • Cai XJ, Gu GY, He BS (2014) On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators. Comput Optim Appl 57(2):339–363

    Article  MathSciNet  Google Scholar 

  • Chang CC, Lin CJ (2011) LIBSVM: a library for support vector machines. ACM Trans Intell Syst Technol 2(3):1–27

    Article  Google Scholar 

  • Ding YY, Xiao YH, Li JW (2017) A class of conjugate gradient methods for convex constrained monotone equations. Optimization 66(12):2309–2328

    Article  MathSciNet  Google Scholar 

  • Dolan ED, Moré JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91(2):201–213

    Article  MathSciNet  Google Scholar 

  • Facchinei F, Pang J-S (2003) Finite-dimensional variational inequalities and complementarity problems, vol I. Springer, Berlin

    MATH  Google Scholar 

  • Gao PT, He CJ (2018) An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints. Calcolo 55(4):53

    Article  MathSciNet  Google Scholar 

  • Gao PT, He CJ, Liu Y (2019) An adaptive family of projection methods for constrained monotone nonlinear equations with applications. Appl Math Comput 359:1–16

    MathSciNet  MATH  Google Scholar 

  • Ibrahim AH, Kumam P, Kumam W (2020) A family of derivative-free conjugate gradient methods for constrained nonlinear equations and image restoration. IEEE Access 8:162714–162729

    Article  Google Scholar 

  • Ibrahim AH, Kumam P, Sun M et al (2021) Projection method with inertial step for nonlinear equations: application to signal recovery. J Ind Manage Optim. https://doi.org/10.3934/jimo.2021173

    Article  Google Scholar 

  • Ibrahim AH, Kumam P, Abubakar AB et al (2022) Accelerated derivative-free method for nonlinear monotone equations with an application. Numer Linear Algebra Appl 29(3):e2424

    MathSciNet  MATH  Google Scholar 

  • Liu JK, Feng YM (2019) A derivative-free iterative method for nonlinear monotone equations with convex constraints. Numer Algor 82:245–262

    Article  MathSciNet  Google Scholar 

  • Liu JK, Li SJ (2017) Multivariate spectral DY-type projection method for convex constrained nonlinear monotone equations. J Ind Manage Optim 13(1):283–295

    Article  MathSciNet  Google Scholar 

  • Liu JK, Lu ZL, Xu JL et al (2022) An efficient projection-based algorithm without Lipschitz continuity for large-scale nonlinear pseudo-monotone equations. J Comput Appl Math 403:113822

    Article  MathSciNet  Google Scholar 

  • Luo H (2021) Accelerated primal-dual methods for linearly constrained convex optimization problems. arXiv: 2109.12604

  • Moudafi A, Elizabeth E (2003) Approximate inertial proximal methods using the enlargement of maximal monotone operators. Int J Pure Appl Math 5(3):283–299

    MathSciNet  MATH  Google Scholar 

  • Moudafi A, Oliny M (2003) Convergence of a splitting inertial proximal method for monotone operators. J Comput Appl Math 155(2):447–454

    Article  MathSciNet  Google Scholar 

  • Papp Z, Rapajić S (2015) FR type methods for systems of large-scale nonlinear monotone equations. Appl Math Comput 269:816–823

    MathSciNet  MATH  Google Scholar 

  • Qu B, Xiu N (2005) A note on the CQ algorithm for the split feasibility problem. Inverse Probl 21(5):1655–1665

    Article  MathSciNet  Google Scholar 

  • Shehu Y, Dong QL, Jiang D (2019) Single projection method for pseudo-monotone variational inequality in Hilbert spaces. Optimization 68(1):385–409

    Article  MathSciNet  Google Scholar 

  • Sun M, Liu J (2015) Three derivative-free projection methods for nonlinear equations with convex constraints. J Appl Math Comput 47(1):265–276

    Article  MathSciNet  Google Scholar 

  • Sun M, Liu J (2015) A modified Hestenes–Stiefel projection method for constrained nonlinear equations and its linear convergence rate. J Appl Math Comput 49(1–2):145–156

    Article  MathSciNet  Google Scholar 

  • Sun M, Liu J (2016) New hybrid conjugate gradient projection method for the convex constrained equations. Calcolo 53:399–411

    Article  MathSciNet  Google Scholar 

  • Vuong PT (2021) A second order dynamical system and its discretization for strongly pseudo-monotone variational inequalities. SIAM J Control Optim 59(4):2875–2897

    Article  MathSciNet  Google Scholar 

  • Wang CW, Wang YJ, Xu CL (2007) A projection method for a system of nonlinear monotone equations with convex constraints. Math Methods Oper Res 66(1):33–46

    Article  MathSciNet  Google Scholar 

  • Wang XY, Li SJ, Kou XP (2016) A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints. Calcolo 53(2):133–145

    Article  MathSciNet  Google Scholar 

  • Xiao YH, Zhu H (2013) A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing. J Math Anal Appl 405(1):310–319

    Article  MathSciNet  Google Scholar 

  • Xiao YH, Wang QY, Hu QJ (2011) Non-smooth equations based method for \(\ell _1\)-norm problems with applications to compressed sensing. Nonlinear Anal 74(11):3570–3577

    Article  MathSciNet  Google Scholar 

  • Yin JH, Jian JB, Jiang XZ (2020) A spectral gradient projection algorithm for convex constrained nonsmooth equations based on an adaptive line search. Math Numer Sin (Chin) 42(4):457–471

    MathSciNet  MATH  Google Scholar 

  • Yin J, Jian J, Jiang X (2021) A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration. J Comput Appl Math 391:113423

    Article  MathSciNet  Google Scholar 

  • Yin J, Jian J, Jiang X et al (2021) A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications. Numer Algor 88(1):389–418

    Article  MathSciNet  Google Scholar 

  • Yu ZS, Lin J, Sun J et al (2009) Spectral gradient projection method for monotone nonlinear equations with convex constraints. Appl Numer Math 59(10):2416–2423

    Article  MathSciNet  Google Scholar 

  • Yu GH, Niu SZ, Ma JH (2013) Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints. J Ind Manage Optim 9(1):117–129

    Article  MathSciNet  Google Scholar 

Download references

Funding

This work was supported by the National Natural Science Foundation of China (12171106) and the Natural Science Foundation of Guangxi Province (2020GXNSFDA238017).

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Jianghua Yin or Chunming Tang.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jian, J., Yin, J., Tang, C. et al. A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications. Comp. Appl. Math. 41, 309 (2022). https://doi.org/10.1007/s40314-022-02019-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s40314-022-02019-6

Keywords

Mathematics Subject Classification