EXTRAGRADIENT-PROJECTION METHOD FOR SOLVING CONSTRAINED CONVEX MINIMIZATION PROBLEMS

被引:18
|
作者
Ceng, Lu-Chuan [1 ]
Ansari, Qamrul Hasan [2 ]
Yao, Jen-Chih [3 ]
机构
[1] Shanghai Normal Univ, Dept Math, Sci Comp Key Lab Shanghai Univ, Shanghai 200234, Peoples R China
[2] Aligarh Muslim Univ, Dept Math, Aligarh 202002, Uttar Pradesh, India
[3] Kaohsiung Med Univ, Ctr Gen Educ, Kaohsiung 80708, Taiwan
来源
基金
美国国家科学基金会;
关键词
Extragradient-projection method; constrained convex minimization; averaged mapping; nonexpansive mapping; relaxed extragradient-projection method; iterative processes;
D O I
10.3934/naco.2011.1.341
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we introduce an iterative process for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of a constrained convex minimization problem for a Frechet differentiable function. The iterative process is based on the so-called extragradient-projection method. We derive several weak convergence results for two sequences generated by the proposed iterative process. On the other hand, by applying the viscosity approximation method and the additional projection method (namely, the CQ method) to the extragradient-projection method, respectively, we also provide two modifications of the extragradient-projection method to obtain two strong convergence theorems. The results of this paper represent the supplement, improvement, extension and development of some known results given in the literature.
引用
收藏
页码:341 / 359
页数:19
相关论文
共 50 条
  • [31] ON THE RESOLUTION OF LINEARLY CONSTRAINED CONVEX MINIMIZATION PROBLEMS
    FRIEDLANDER, A
    MARTINEZ, JM
    SANTOS, SA
    SIAM JOURNAL ON OPTIMIZATION, 1994, 4 (02) : 331 - 339
  • [32] A projection-free method for solving convex bilevel optimization problems
    Giang-Tran, Khanh-Hung
    Ho-Nguyen, Nam
    Lee, Dabeen
    MATHEMATICAL PROGRAMMING, 2024,
  • [33] A LEARNING-ENHANCED PROJECTION METHOD FOR SOLVING CONVEX FEASIBILITY PROBLEMS
    Rieger, Janosch
    DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS-SERIES B, 2022, 27 (01): : 555 - 568
  • [34] Residual selection in a projection method for convex minimization problems (vol 52, 2003)
    Cegielski, A
    Dylewski, R
    OPTIMIZATION, 2003, 52 (03) : 361 - 361
  • [35] Projection algorithms for solving convex feasibility problems
    Bauschke, HH
    Borwein, JM
    SIAM REVIEW, 1996, 38 (03) : 367 - 426
  • [36] Novel Algorithms with Inertial Techniques for Solving Constrained Convex Minimization Problems and Applications to Image Inpainting
    Hanjing, Adisak
    Suantai, Suthep
    MATHEMATICS, 2023, 11 (08)
  • [37] The conjugate gradient method for split variational inclusion and constrained convex minimization problems
    Che, Haitao
    Li, Meixia
    APPLIED MATHEMATICS AND COMPUTATION, 2016, 290 : 426 - 438
  • [38] An Efficient Method for Convex Constrained Rank Minimization Problems Based on DC Programming
    Yang, Wanping
    Zhao, Jinkai
    Xu, Fengmin
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2016, 2016
  • [39] AN IMPROVED INERTIAL PROJECTION METHOD FOR SOLVING CONVEX CONSTRAINED MONOTONE NONLINEAR EQUATIONS WITH APPLICATIONS
    Zhu, Zhibin
    Tan, Zhen
    Zhu, Xiaowen
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2024, 20 (01) : 325 - 346
  • [40] A PROXIMAL-PROJECTION PARTIAL BUNDLE METHOD FOR CONVEX CONSTRAINED MINIMAX PROBLEMS
    Tang, Chunming
    Jian, Jinbao
    Li, Guoyin
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2019, 15 (02) : 757 - 774