A primal nonsmooth reformulation for bilevel optimization problems
From MaRDI portal
Publication:2693646
DOI10.1007/s10107-021-01764-6OpenAlexW4206826713MaRDI QIDQ2693646
Lucas E. A. Simões, Sandra Augusta Santos, Elias Salomão Helou
Publication date: 24 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-021-01764-6
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the solution of convex bilevel optimization problems
- Nonsmooth optimization via quasi-Newton methods
- Solving mathematical programs with equilibrium constraints
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Double penalty method for bilevel optimization problems
- Practical bilevel optimization. Algorithms and applications
- Descent approaches for quadratic bilevel programming
- The steepest descent direction for the nonlinear bilevel programming problem
- A bilevel programming approach to determining tax credits for biofuel production
- Foundations of bilevel programming
- A bridge between bilevel programs and Nash games
- On the local convergence analysis of the gradient sampling method for finite max-functions
- A fast gradient and function sampling method for finite-max functions
- Solving bilevel programs with the KKT-approach
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Gauss-Newton-type methods for bilevel optimization
- Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
- Numerically tractable optimistic bilevel problems
- An overview of bilevel optimization
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- A Bilevel Optimization Approach for Parameter Learning in Variational Models
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization
- Bilevel Optimization with Nonsmooth Lower Level Problems
- Bilevel programming with convex lower level problems
- Optimality conditions for bilevel programming problems
- Reformulation of the M-Stationarity Conditions as a System of Discontinuous Equations and Its Solution by a Semismooth Newton Method
- BOLIB: Bilevel Optimization LIBrary of Test Problems
- A New Sequential Optimality Condition for Constrained Nonsmooth Optimization
- ϵ-subgradient algorithms for bilevel convex optimization
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- Optimizing Frequencies in a Transit Network: a Nonlinear Bi‐level Programming Approach
- A First Order Method for Solving Convex Bilevel Optimization Problems
- An inertial extrapolation method for convex simple bilevel optimization
This page was built for publication: A primal nonsmooth reformulation for bilevel optimization problems
