IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v150y2011i2d10.1007_s10957-011-9837-z.html
   My bibliography  Save this article

Averaged Mappings and the Gradient-Projection Algorithm

Author

Listed:
  • Hong-Kun Xu

    (National Sun Yat-sen University
    King Saud University)

Abstract

It is well known that the gradient-projection algorithm (GPA) plays an important role in solving constrained convex minimization problems. In this article, we first provide an alternative averaged mapping approach to the GPA. This approach is operator-oriented in nature. Since, in general, in infinite-dimensional Hilbert spaces, GPA has only weak convergence, we provide two modifications of GPA so that strong convergence is guaranteed. Regularization is also applied to find the minimum-norm solution of the minimization problem under investigation.

Suggested Citation

  • Hong-Kun Xu, 2011. "Averaged Mappings and the Gradient-Projection Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 150(2), pages 360-378, August.
    • Handle: RePEc:spr:joptap:v:150:y:2011:i:2:d:10.1007_s10957-011-9837-z
    DOI: 10.1007/s10957-011-9837-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-011-9837-z
    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/s10957-011-9837-z?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. Han, Deren & Lo, Hong K., 2004. "Solving non-additive traffic assignment problems: A descent method for co-coercive variational inequalities," European Journal of Operational Research, Elsevier, vol. 159(3), pages 529-544, December.
    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. Taksaporn Sirirut & Pattanapong Tianchai, 2018. "On Solving of Constrained Convex Minimize Problem Using Gradient Projection Method," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2018, pages 1-10, October.
    2. Haiyun Zhou & Peiyuan Wang, 2014. "A Simpler Explicit Iterative Algorithm for a Class of Variational Inequalities in Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 161(3), pages 716-727, June.
    3. Peichao Duan & Xubang Zheng & Jing Zhao, 2018. "Strong Convergence Theorems of Viscosity Iterative Algorithms for Split Common Fixed Point Problems," Mathematics, MDPI, vol. 7(1), pages 1-14, December.
    4. Yuanheng Wang & Tiantian Xu & Jen-Chih Yao & Bingnan Jiang, 2022. "Self-Adaptive Method and Inertial Modification for Solving the Split Feasibility Problem and Fixed-Point Problem of Quasi-Nonexpansive Mapping," Mathematics, MDPI, vol. 10(9), pages 1-15, May.
    5. Lu-Chuan Ceng & Sy-Ming Guu & Jen-Chih Yao, 2014. "Hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense," Journal of Global Optimization, Springer, vol. 60(4), pages 617-634, December.
    6. Suthep Suantai & Kunrada Kankam & Prasit Cholamjiak, 2021. "A Projected Forward-Backward Algorithm for Constrained Minimization with Applications to Image Inpainting," Mathematics, MDPI, vol. 9(8), pages 1-14, April.
    7. Che, Haitao & Li, Meixia, 2016. "The conjugate gradient method for split variational inclusion and constrained convex minimization problems," Applied Mathematics and Computation, Elsevier, vol. 290(C), pages 426-438.
    8. Ming Tian & Min-Min Li, 2014. "A General Iterative Method for Solving Constrained Convex Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 162(1), pages 202-207, July.
    9. Rattanakorn Wattanataweekul & Kobkoon Janngam & Suthep Suantai, 2023. "A Novel Two-Step Inertial Viscosity Algorithm for Bilevel Optimization Problems Applied to Image Recovery," Mathematics, MDPI, vol. 11(16), pages 1-20, August.
    10. Songnian He & Qiao-Li Dong, 2018. "The Combination Projection Method for Solving Convex Feasibility Problems," Mathematics, MDPI, vol. 6(11), pages 1-13, November.
    11. Ali Abkar & Elahe Shahrosvand & Azizollah Azizi, 2017. "The Split Common Fixed Point Problem for a Family of Multivalued Quasinonexpansive Mappings and Totally Asymptotically Strictly Pseudocontractive Mappings in Banach Spaces," Mathematics, MDPI, vol. 5(1), pages 1-18, February.
    12. Yuanheng Wang & Mingyue Yuan & Bingnan Jiang, 2021. "Multi-Step Inertial Hybrid and Shrinking Tseng’s Algorithm with Meir–Keeler Contractions for Variational Inclusion Problems," Mathematics, MDPI, vol. 9(13), pages 1-13, July.
    13. Seifu Endris Yimer & Poom Kumam & Anteneh Getachew Gebrie & Rabian Wangkeeree, 2019. "Inertial Method for Bilevel Variational Inequality Problems with Fixed Point and Minimizer Point Constraints," Mathematics, MDPI, vol. 7(9), pages 1-21, September.
    14. Bingnan Jiang & Yuanheng Wang & Jen-Chih Yao, 2021. "Multi-Step Inertial Regularized Methods for Hierarchical Variational Inequality Problems Involving Generalized Lipschitzian Mappings," Mathematics, MDPI, vol. 9(17), pages 1-20, August.
    15. Ming Tian & Meng-Ying Tong, 2019. "Extension and Application of the Yamada Iteration Algorithm in Hilbert Spaces," Mathematics, MDPI, vol. 7(3), pages 1-13, February.
    16. Q. L. Dong & J. Z. Huang & X. H. Li & Y. J. Cho & Th. M. Rassias, 2019. "MiKM: multi-step inertial Krasnosel’skiǐ–Mann algorithm and its applications," Journal of Global Optimization, Springer, vol. 73(4), pages 801-824, April.
    17. Bing Tan & Shanshan Xu & Songxiao Li, 2020. "Modified Inertial Hybrid and Shrinking Projection Algorithms for Solving Fixed Point Problems," Mathematics, MDPI, vol. 8(2), pages 1-12, February.
    18. Suthep Suantai & Kunrada Kankam & Prasit Cholamjiak, 2020. "A Novel Forward-Backward Algorithm for Solving Convex Minimization Problem in Hilbert Spaces," Mathematics, MDPI, vol. 8(1), pages 1-13, January.
    19. Suthep Suantai & Narin Petrot & Montira Suwannaprapa, 2019. "Iterative Methods for Finding Solutions of a Class of Split Feasibility Problems over Fixed Point Sets in Hilbert Spaces," Mathematics, MDPI, vol. 7(11), pages 1-21, October.
    20. Dang Hieu & Pham Kim Quy, 2023. "One-Step iterative method for bilevel equilibrium problem in Hilbert space," Journal of Global Optimization, Springer, vol. 85(2), pages 487-510, 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. Zangui, Mahmood & Aashtiani, Hedayat Z. & Lawphongpanich, Siriphong & Yin, Yafeng, 2015. "Path-differentiated pricing in congestion mitigation," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 202-219.
    2. Perederieieva, Olga & Raith, Andrea & Schmidt, Marie, 2018. "Non-additive shortest path in the context of traffic assignment," European Journal of Operational Research, Elsevier, vol. 268(1), pages 325-338.
    3. Li, Min & Liao, Li-Zhi & Yuan, Xiao-ming, 2008. "A modified descent method for co-coercive variational inequalities," European Journal of Operational Research, Elsevier, vol. 189(2), pages 310-323, September.
    4. Maadi, Saeed & Schmöcker, Jan-Dirk, 2017. "Optimal hyperpaths with non-additive link costs," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 235-248.
    5. Siu, Barbara W.Y. & Lo, Hong K., 2008. "Doubly uncertain transportation network: Degradable capacity and stochastic demand," European Journal of Operational Research, Elsevier, vol. 191(1), pages 166-181, November.
    6. Luan, Mingye & Waller, S.Travis & Rey, David, 2023. "A non-additive path-based reward credit scheme for traffic congestion management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    7. Luan, Jianlin & Polak, John & Krishnan, Rajesh, 2019. "The structure of public-private sector collaboration in travel information markets: A game theoretic analysis," Transportation Research Part A: Policy and Practice, Elsevier, vol. 129(C), pages 19-38.
    8. František Kolovský & Ivana Kolingerová, 2022. "The Piecewise Constant/Linear Solution for Dynamic User Equilibrium," Networks and Spatial Economics, Springer, vol. 22(4), pages 737-765, December.
    9. Szeto, W.Y. & Lo, Hong K., 2008. "Time-dependent transport network improvement and tolling strategies," Transportation Research Part A: Policy and Practice, Elsevier, vol. 42(2), pages 376-391, February.
    10. Ma, Jie & Xu, Min & Meng, Qiang & Cheng, Lin, 2020. "Ridesharing user equilibrium problem under OD-based surge pricing strategy," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 1-24.

    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:joptap:v:150:y:2011:i:2:d:10.1007_s10957-011-9837-z. 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.