A new accelerated algorithm with a linesearch technique for convex bilevel optimization problems with applications
Authors:
Open Access
- 1 January 2024
- journal article
- research article
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 9 (8) , 22366-22392
Abstract
We considered a convex bilevel optimization problem when the outer level problem was to find a minimizer of a strongly convex function over the set of solutions of the inner level problem which was in the form of minimization of the sum of a convex differentiable function and a nonsmooth convex function. In this work, we proposed a novel accelerated algorithm by employing both linesearch and inertial techniques for solving a convex bilevel optimization problem. Then, we proved the strong convergence of the sequence generated by our proposed algorithm to an optimal solution of the convex bilevel optimization problems without the continuity assumption on the gradient of the objective function. Moreover, we presented the convergence behavior of the proposed method by some numerical experiments addressing image restoration problems and data classification problems with least squares constraints. Finally, the performances of the restorative image and the data classification of the proposed method were compared with other existing algorithms in the literature. According to the experiment, our proposed algorithm had a better convergence behavior than the others in the literature.Keywords
This publication has 29 references indexed in Scilit:
- Forward–Reflected–Backward Splitting Algorithms with Momentum: Weak, Linear and Strong Convergence ResultsJournal of Optimization Theory and Applications, 2024
- Strongly Convergent Inertial Proximal Point Algorithm Without On-line RuleJournal of Optimization Theory and Applications, 2023
- On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimizationMathematical Methods in the Applied Sciences, 2019
- Deep extreme learning machines: supervised autoencoding architecture for classificationNeurocomputing, 2016
- Strong Convergence of Projected Subgradient Methods for Nonsmooth and Nonstrictly Convex MinimizationSet-Valued Analysis, 2008
- Extreme learning machine: Theory and applicationsNeurocomputing, 2006
- Viscosity approximation methods for nonexpansive mappingsJournal of Mathematical Analysis and Applications, 2004
- Another control condition in an iterative method for nonexpansive mappingsBulletin of the Australian Mathematical Society, 2002
- International application of a new probability algorithm for the diagnosis of coronary artery diseaseThe American Journal of Cardiology, 1989
- Some methods of speeding up the convergence of iteration methodsUSSR Computational Mathematics and Mathematical Physics, 1964