A primal nonsmooth reformulation for bilevel optimization problems
From MaRDI portal
Recommendations
- Bilevel optimization: reformulation and first optimality conditions
- Techniques for gradient-based bilevel optimization with non-smooth lower level problems
- Single-level reformulations of a specific non-smooth bilevel programming problem and their applications
- On solving simple bilevel programs with a nonconvex lower level program
- Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems
Cites work
- -subgradient algorithms for bilevel convex optimization
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- A bilevel model of taxation and its application to optimal highway pricing
- A bilevel optimization approach for parameter learning in variational models
- A bilevel programming approach to determining tax credits for biofuel production
- A bridge between bilevel programs and Nash games
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- A fast gradient and function sampling method for finite-max functions
- A first order method for solving convex bilevel optimization problems
- A new sequential optimality condition for constrained nonsmooth optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- An inertial extrapolation method for convex simple bilevel optimization
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities
- An overview of bilevel optimization
- Bilevel optimization with nonsmooth lower level problems
- Bilevel programming with convex lower level problems
- BOLIB: bilevel Optimization LIBrary of test problems
- Descent approaches for quadratic bilevel programming
- Double penalty method for bilevel optimization problems
- Foundations of bilevel programming
- Gauss-Newton-type methods for bilevel optimization
- scientific article; zbMATH DE number 4061013 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 53256 (Why is no real title available?)
- scientific article; zbMATH DE number 1351867 (Why is no real title available?)
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- Nonsmooth optimization via quasi-Newton methods
- Numerically tractable optimistic bilevel problems
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization
- On the local convergence analysis of the gradient sampling method for finite max-functions
- On the solution of convex bilevel optimization problems
- Optimality conditions for bilevel programming problems
- Optimizing Frequencies in a Transit Network: a Nonlinear Bi‐level Programming Approach
- Practical bilevel optimization. Algorithms and applications
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
- Reformulation of the M-stationarity conditions as a system of discontinuous equations and its solution by a semismooth Newton method
- Solving bilevel programs with the KKT-approach
- Solving mathematical programs with equilibrium constraints
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- The steepest descent direction for the nonlinear bilevel programming problem
- Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
Cited in
(7)- Single-level reformulations of a specific non-smooth bilevel programming problem and their applications
- Bilevel optimization with nonsmooth lower level problems
- Techniques for gradient-based bilevel optimization with non-smooth lower level problems
- scientific article; zbMATH DE number 1322063 (Why is no real title available?)
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems
- Inexact Direct-Search Methods for Bilevel Optimization Problems
This page was built for publication: A primal nonsmooth reformulation for bilevel optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693646)
