An inertial extrapolation method for convex simple bilevel optimization
From MaRDI portal
Abstract: We consider a scalar objective minimization problem over the solution set of another optimization problem. This problem is known as simple bilevel optimization problem and has drawn a significant attention in the last few years. Our inner problem consists of minimizing the sum of smooth and nonsmooth functions while the outer one is the minimization of a smooth convex function. We propose and establish the convergence of a fixed-point iterative method with inertial extrapolation to solve the problem. Our numerical experiments show that the method proposed in this paper outperforms the currently best known algorithm to solve the class of problem considered.
Recommendations
- A first order method for solving convex bilevel optimization problems
- An inertial extragradient method for solving bilevel equilibrium problems
- Algorithms for simple bilevel programming
- Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems
- scientific article; zbMATH DE number 5176444
Cites work
- A dynamical approach to an inertial forward-backward algorithm for convex minimization
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first order method for finding minimal norm-like solutions of convex optimization problems
- A first order method for solving convex bilevel optimization problems
- A Hybrid Extragradient-Viscosity Method for Monotone Operators and Fixed Point Problems
- A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Algorithms for the vector maximization problem
- An inertial alternating direction method of multipliers
- Connections between single-level and bilevel multiobjective optimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Finite perturbation of convex programs
- Foundations of bilevel programming
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 3581570 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 5176444 (Why is no real title available?)
- iPiasco: inertial proximal algorithm for strongly convex optimization
- Multiobjective bilevel optimization
- Nonlinear Perturbation of Linear Programs
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- Optimality conditions for bilevel programming problems
- Optimality conditions for the simple convex bilevel programming problem in Banach spaces
- Optimization over the efficient set: overview
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
- Viscosity approximation methods for nonexpansive mappings
Cited in
(51)- A self-adaptive extragradient-CQ method for a class of bilevel split equilibrium problem with application to Nash Cournot oligopolistic electricity market models
- Self adaptive inertial extragradient algorithms for solving bilevel pseudomonotone variational inequality problems
- Convergence of relaxed inertial subgradient extragradient methods for quasimonotone variational inequality problems
- Two adaptive modified subgradient extragradient methods for bilevel pseudomonotone variational inequalities with applications
- New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity
- Equilibrium selection for multi-portfolio optimization
- Resolvent-Mann-type algorithm for bilevel problems with split feasibility problem constraint
- An algorithm for split equilibrium and fixed-point problems using inertial extragradient techniques
- A primal nonsmooth reformulation for bilevel optimization problems
- Regularization and approximation methods in Stackelberg games and bilevel optimization
- Algorithms for simple bilevel programming
- BOLIB: bilevel Optimization LIBrary of test problems
- Strong convergence of multi-parameter projection methods for variational inequality problems
- Modified Tseng's extragradient methods with self-adaptive step size for solving bilevel split variational inequality problems
- Combining approximation and exact penalty in hierarchical programming
- scientific article; zbMATH DE number 5176444 (Why is no real title available?)
- A first order method for solving convex bilevel optimization problems
- A self-adaptive inertial subgradient extragradient algorithm for solving bilevel equilibrium problems
- A bilevel approach to ESG multi-portfolio selection
- Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function
- Convergences for robust bilevel polynomial programmes with applications
- Modified subgradient extragradient methods for solving bilevel split variational inequality problems in Hilbert spaces
- Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems
- An inertial projection and contraction method for solving bilevel quasimonotone variational inequality problems
- A novel algorithm for convex bi-level optimization problems in Hilbert spaces with applications
- Linearly convergent bilevel optimization with single-step inner methods
- Strong convergence of forward-reflected-backward splitting methods for solving monotone inclusions with applications to image restoration and optimal control
- Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems
- Alternated inertial relaxed Tseng method for solving fixed point and quasi-monotone variational inequality problems
- Accelerated fixed point algorithm for convex bi-level optimization problems in Hilbert spaces with applications
- Solving bilevel quasimonotone variational inequality problem in Hilbert spaces
- Two novel algorithms for solving variational inequality problems governed by fixed point problems and their applications
- An inertial method for solving bilevel variational inequality problems with fixed point constraints
- A relaxed projection method for solving bilevel variational inequality problems
- A novel fixed-point based two-step inertial algorithm for convex bilevel optimization in deep learning data classification
- A double inertial fixed point algorithm with linesearch and its application to machine learning for data classification
- An extragradient method with conjugate gradient-type direction for solving variational inequalities with application
- A new double inertial subgradient extragradient method for solving quasimonotone variational inequality problems
- Two regularized inertial Tseng methods for solving inclusion problems with applications to convex bilevel programming
- A novel double inertial viscosity algorithm for convex bilevel optimization problems applied to image restoration problems
- A projection-free method for solving convex bilevel optimization problems
- A fast forward-backward algorithm using linesearch and inertial techniques for convex bi-level optimization problems with applications
- Generalized split feasibility problem: solution by iteration
- A new viscosity approximation method with inertial technique for convex bilevel optimization problems and applications
- Strong convergence of inertial extragradient methods for solving pseudomonotone variational inequality problems
- A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems
- A modified inertial Tseng technique of bilevel variational inequality problem with application to image processing
- A new relaxed inertial method for solving monotone inclusion problem
- On the convergence rates of iterative regularization algorithms for composite bilevel optimization
- Double inertial viscosity forward-backward algorithm for split variational inclusion with applications to deblurring of medical images and data classification
- Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems
This page was built for publication: An inertial extrapolation method for convex simple bilevel optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859007)
