IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i9p1491-d806239.html
   My bibliography  Save this article

An Accelerated Convex Optimization Algorithm with Line Search and Applications in Machine Learning

Author

Listed:
  • Dawan Chumpungam

    (Data Science Research Center, Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand)

  • Panitarn Sarnmeta

    (KOSEN-KMITL, Bangkok 10520, Thailand)

  • Suthep Suantai

    (Data Science Research Center, Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand
    Research Group in Mathematics and Applied Mathematics, Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand)

Abstract

In this paper, we introduce a new line search technique, then employ it to construct a novel accelerated forward–backward algorithm for solving convex minimization problems of the form of the summation of two convex functions in which one of these functions is smooth in a real Hilbert space. We establish a weak convergence to a solution of the proposed algorithm without the Lipschitz assumption on the gradient of the objective function. Furthermore, we analyze its performance by applying the proposed algorithm to solving classification problems on various data sets and compare with other line search algorithms. Based on the experiments, the proposed algorithm performs better than other line search algorithms.

Suggested Citation

  • Dawan Chumpungam & Panitarn Sarnmeta & Suthep Suantai, 2022. "An Accelerated Convex Optimization Algorithm with Line Search and Applications in Machine Learning," Mathematics, MDPI, vol. 10(9), pages 1-20, April.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:9:p:1491-:d:806239
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/9/1491/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/9/1491/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Dang Hieu, 2018. "An inertial-like proximal algorithm for equilibrium problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 88(3), pages 399-415, December.
    2. Adisak Hanjing & Limpapat Bussaban & Suthep Suantai, 2022. "The Modified Viscosity Approximation Method with Inertial Technique and Forward–Backward Algorithm for Convex Optimization Model," Mathematics, MDPI, vol. 10(7), pages 1-16, March.
    3. Regina S. Burachik & Alfredo N. Iusem, 2008. "Set-Valued Mappings and Enlargements of Monotone Operators," Springer Optimization and Its Applications, Springer, number 978-0-387-69757-4, September.
    4. Regina S. Burachik & Alfredo N. Iusem, 2008. "Enlargements of Monotone Operators," Springer Optimization and Its Applications, in: Set-Valued Mappings and Enlargements of Monotone Operators, chapter 0, pages 161-220, Springer.
    5. Adisak Hanjing & Suthep Suantai, 2020. "A Fast Image Restoration Algorithm Based on a Fixed Point and Optimization Method," Mathematics, MDPI, vol. 8(3), pages 1-13, March.
    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. Dawan Chumpungam & Panitarn Sarnmeta & Suthep Suantai, 2021. "A New Forward–Backward Algorithm with Line Searchand Inertial Techniques for Convex Minimization Problems with Applications," Mathematics, MDPI, vol. 9(13), pages 1-20, July.
    2. 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.
    3. 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.
    4. Walaa M. Moursi & Lieven Vandenberghe, 2019. "Douglas–Rachford Splitting for the Sum of a Lipschitz Continuous and a Strongly Monotone Operator," Journal of Optimization Theory and Applications, Springer, vol. 183(1), pages 179-198, October.
    5. Sedi Bartz & Minh N. Dao & Hung M. Phan, 2022. "Conical averagedness and convergence analysis of fixed point algorithms," Journal of Global Optimization, Springer, vol. 82(2), pages 351-373, February.
    6. Bello Cruz, J.Y. & Iusem, A.N., 2015. "Full convergence of an approximate projection method for nonsmooth variational inequalities," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 114(C), pages 2-13.
    7. Rubén López, 2013. "Variational convergence for vector-valued functions and its applications to convex multiobjective optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(1), pages 1-34, August.
    8. Regina S. Burachik & Minh N. Dao & Scott B. Lindstrom, 2021. "Generalized Bregman Envelopes and Proximity Operators," Journal of Optimization Theory and Applications, Springer, vol. 190(3), pages 744-778, September.
    9. Warunun Inthakon & Suthep Suantai & Panitarn Sarnmeta & Dawan Chumpungam, 2020. "A New Machine Learning Algorithm Based on Optimization Method for Regression and Classification Problems," Mathematics, MDPI, vol. 8(6), pages 1-17, June.
    10. Jonathan M. Borwein & Liangjin Yao, 2013. "Structure Theory for Maximally Monotone Operators with Points of Continuity," Journal of Optimization Theory and Applications, Springer, vol. 157(1), pages 1-24, April.
    11. Ludovic Nagesseur, 2016. "A bundle method using two polyhedral approximations of the $$\varepsilon $$ ε -enlargement of a maximal monotone operator," Computational Optimization and Applications, Springer, vol. 64(1), pages 75-100, May.
    12. Juan Pablo Luna & Claudia Sagastizábal & Mikhail Solodov, 2020. "A class of Benders decomposition methods for variational inequalities," Computational Optimization and Applications, Springer, vol. 76(3), pages 935-959, July.
    13. Edvaldo E. A. Batista & Glaydston de Carvalho Bento & Orizon P. Ferreira, 2016. "Enlargement of Monotone Vector Fields and an Inexact Proximal Point Method for Variational Inequalities in Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 170(3), pages 916-931, September.
    14. J. Y. Bello Cruz & R. Díaz Millán, 2016. "A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces," Journal of Global Optimization, Springer, vol. 65(3), pages 597-614, July.
    15. Heinz H. Bauschke & Warren L. Hare & Walaa M. Moursi, 2016. "On the Range of the Douglas–Rachford Operator," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 884-897, August.
    16. Regina S. Burachik & C. Yalçın Kaya & Shoham Sabach, 2012. "A Generalized Univariate Newton Method Motivated by Proximal Regularization," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 923-940, December.
    17. Hsien-Chung Wu, 2018. "Near Fixed Point Theorems in Hyperspaces," Mathematics, MDPI, vol. 6(6), pages 1-15, May.
    18. Walaa M. Moursi, 2018. "The Forward–Backward Algorithm and the Normal Problem," Journal of Optimization Theory and Applications, Springer, vol. 176(3), pages 605-624, March.
    19. Henri Bonnel & Julien Collonge, 2014. "Stochastic Optimization over a Pareto Set Associated with a Stochastic Multi-Objective Optimization Problem," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 405-427, August.
    20. Hsien-Chung Wu, 2019. "Informal Norm in Hyperspace and Its Topological Structure," Mathematics, MDPI, vol. 7(10), pages 1-20, October.

    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:gam:jmathe:v:10:y:2022:i:9:p:1491-:d:806239. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.