IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v247y2026icp523-544.html

A novel memory gradient method for unconstrained multiobjective optimization problems with application to image restoration

Author

Listed:
  • Peng, Jianwen
  • Liu, Dong
  • Zhang, Xueqing
  • Yao, Jen-Chih

Abstract

In the field of image restoration, image data fidelity seeks to preserve details to the greatest extent possible, including noise, while edge-preserving image smoothing requires noise suppression. Excessive noise suppression, however, degrades fidelity. Striking an appropriate balance between the two is thus highly challenging. This paper introduces a memory gradient method for solving unconstrained multi-objective optimization problems. The search direction of the proposed method is a combination of the steepest descent directions from the previous two iterations and the search direction of the prior step, ensuring its sufficient descent property. Under the Wolfe line search framework, the global convergence of the method is still guaranteed even if the gradient of the objective function does not satisfy the commonly required Lipschitz continuity condition. Finally, in the first part of the numerical experiments, the proposed algorithm exhibits certain improvements in iterative performance compared with several classical multi-objective gradient algorithms. In the second part, we apply the method to image restoration tasks. The results demonstrate the effectiveness of applying multi-objective gradient algorithms to image restoration, primarily reflected in their ability to restore the quality of certain images in an extremely short time.

Suggested Citation

  • Peng, Jianwen & Liu, Dong & Zhang, Xueqing & Yao, Jen-Chih, 2026. "A novel memory gradient method for unconstrained multiobjective optimization problems with application to image restoration," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 247(C), pages 523-544.
  • Handle: RePEc:eee:matcom:v:247:y:2026:i:c:p:523-544
    DOI: 10.1016/j.matcom.2026.03.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475426001229
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2026.03.031?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Jiawei Chen & Yushan Bai & Guolin Yu & Xiaoqing Ou & Xiaolong Qin, 2025. "A PRP Type Conjugate Gradient Method Without Truncation for Nonconvex Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 204(1), pages 1-30, January.
    2. Gonçalves, M.L.N. & Lima, F.S. & Prudente, L.F., 2022. "A study of Liu-Storey conjugate gradient methods for vector optimization," Applied Mathematics and Computation, Elsevier, vol. 425(C).
    3. M. L. N. Gonçalves & L. F. Prudente, 2020. "On the extension of the Hager–Zhang conjugate gradient method for vector optimization," Computational Optimization and Applications, Springer, vol. 76(3), pages 889-916, July.
    4. Qingjie Hu & Ruyun Li & Yanyan Zhang & Zhibin Zhu, 2024. "On the Extension of Dai-Liao Conjugate Gradient Method for Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 203(1), pages 810-843, October.
    5. Prabuddha De & Jay B. Ghosh & Charles E. Wells, 1992. "On the Minimization of Completion Time Variance with a Bicriteria Extension," Operations Research, INFORMS, vol. 40(6), pages 1148-1155, December.
    6. C. Hillermeier, 2001. "Generalized Homotopy Approach to Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 110(3), pages 557-583, September.
    7. Matteo Lapucci & Pierluigi Mansueto, 2023. "A limited memory Quasi-Newton approach for multi-objective optimization," Computational Optimization and Applications, Springer, vol. 85(1), pages 33-73, May.
    8. Ellen Fukuda & L. Graña Drummond, 2013. "Inexact projected gradient method for vector optimization," Computational Optimization and Applications, Springer, vol. 54(3), pages 473-493, April.
    9. Wang Chen & Xinmin Yang & Yong Zhao, 2023. "Conditional gradient method for vector optimization," Computational Optimization and Applications, Springer, vol. 85(3), pages 857-896, July.
    10. Miglierina, E. & Molho, E. & Recchioni, M.C., 2008. "Box-constrained multi-objective optimization: A gradient-like method without "a priori" scalarization," European Journal of Operational Research, Elsevier, vol. 188(3), pages 662-682, August.
    11. L. F. Prudente & D. R. Souza, 2022. "A Quasi-Newton Method with Wolfe Line Searches for Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 194(3), pages 1107-1140, September.
    12. P. B. Assunção & O. P. Ferreira & L. F. Prudente, 2021. "Conditional gradient method for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 78(3), pages 741-768, April.
    13. Qingjie Hu & Liping Zhu & Yu Chen, 2024. "Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization," Computational Optimization and Applications, Springer, vol. 88(1), pages 217-250, May.
    14. Jörg Fliege & Benar Fux Svaiter, 2000. "Steepest descent methods for multicriteria optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 51(3), pages 479-494, August.
    Full references (including those not matched with items on IDEAS)

    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. Yu Chen & Helong Chen & Zhibin Zhu, 2026. "A Three-Term Conjugate Gradient-Type Method with Sufficient Descent Property for Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 208(1), pages 1-42, January.
    2. Liu, Kaiping & Chen, Jiawei, 2026. "A projected PRP conjugate gradient method for constrained multiobjective optimization with application to friction stir welding," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 244(C), pages 70-89.
    3. Jamilu Yahaya & Poom Kumam & Mahmoud Muhammad Yahaya, 2025. "A New Hybrid Conjugate Gradient Method Based on a Convex Combination for Multiobjective Optimization," SN Operations Research Forum, Springer, vol. 6(2), pages 1-26, June.
    4. Qing-Rui He & Sheng-Jie Li & Ming-Hua Li & Chun-Rong Chen, 2026. "A nonlinear conjugate gradient algorithm for multiobjective optimization: multiple hybrid search direction and global rates," Computational Optimization and Applications, Springer, vol. 93(3), pages 1021-1067, April.
    5. L. F. Prudente & D. R. Souza, 2024. "Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems," Computational Optimization and Applications, Springer, vol. 88(3), pages 719-757, July.
    6. Qing-Rui He & Sheng-Jie Li & Bo-Ya Zhang & Chun-Rong Chen, 2024. "A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization," Computational Optimization and Applications, Springer, vol. 89(3), pages 805-842, December.
    7. Qingjie Hu & Yanyan Zhang & Ruyun Li & Wanyou Cheng, 2026. "A Diagonal Quasi-Newton Method with Modified BFGS Update for Nonconvex Multiobjective Optimization," Journal of Global Optimization, Springer, vol. 94(1), pages 203-233, January.
    8. Qingjie Hu & Ruyun Li & Yanyan Zhang & Zhibin Zhu, 2024. "On the Extension of Dai-Liao Conjugate Gradient Method for Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 203(1), pages 810-843, October.
    9. Gonçalves, M.L.N. & Lima, F.S. & Prudente, L.F., 2022. "A study of Liu-Storey conjugate gradient methods for vector optimization," Applied Mathematics and Computation, Elsevier, vol. 425(C).
    10. Qingjie Hu & Liping Zhu & Yu Chen, 2024. "Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization," Computational Optimization and Applications, Springer, vol. 88(1), pages 217-250, May.
    11. Jian Chen & Liping Tang & Xinmin Yang, 2025. "A Subspace Minimization Barzilai-Borwein Method for Multiobjective Optimization Problems," Computational Optimization and Applications, Springer, vol. 92(1), pages 155-178, September.
    12. Qing-Rui He & Chun-Rong Chen & Sheng-Jie Li, 2023. "Spectral conjugate gradient methods for vector optimization problems," Computational Optimization and Applications, Springer, vol. 86(2), pages 457-489, November.
    13. M. L. N. Gonçalves & F. S. Lima & L. F. Prudente, 2022. "Globally convergent Newton-type methods for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 83(2), pages 403-434, November.
    14. P. B. Assunção & O. P. Ferreira & L. F. Prudente, 2021. "Conditional gradient method for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 78(3), pages 741-768, April.
    15. Chen, Wang & Yang, Xinmin & Zhao, Yong, 2023. "Memory gradient method for multiobjective optimization," Applied Mathematics and Computation, Elsevier, vol. 443(C).
    16. Jamilu Yahaya & Poom Kumam & Sani Salisu & Kanokwan Sitthithakerngkiet, 2024. "Spectral-like conjugate gradient methods with sufficient descent property for vector optimization," PLOS ONE, Public Library of Science, vol. 19(5), pages 1-22, May.
    17. Jiawei Chen & Yushan Bai & Guolin Yu & Xiaoqing Ou & Xiaolong Qin, 2025. "A PRP Type Conjugate Gradient Method Without Truncation for Nonconvex Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 204(1), pages 1-30, January.
    18. Y. Bello-Cruz & J. G. Melo & L. F. Prudente & R. V. G. Serra, 2025. "A proximal gradient method with an explicit line search for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 92(2), pages 437-469, November.
    19. M. L. N. Gonçalves & L. F. Prudente, 2020. "On the extension of the Hager–Zhang conjugate gradient method for vector optimization," Computational Optimization and Applications, Springer, vol. 76(3), pages 889-916, July.
    20. L. F. Prudente & D. R. Souza, 2022. "A Quasi-Newton Method with Wolfe Line Searches for Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 194(3), pages 1107-1140, September.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:matcom:v:247:y:2026:i:c:p:523-544. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.