On solving simple bilevel programs with a nonconvex lower level program
From MaRDI portal
Recommendations
- Bilevel programming problems with simple convex lower level
- Bilevel programming with convex lower level problems
- Bilevel optimization with nonsmooth lower level problems
- On the solution of convex bilevel optimization problems
- A novel approach to bilevel nonlinear programming
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
- scientific article; zbMATH DE number 6874493
- Solving bilevel programming problem by a non-interior point homotopy method
- On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
- A duality approach and optimality conditions for simple convex bilevel programming problems
Cites work
- scientific article; zbMATH DE number 978735 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 2171466 (Why is no real title available?)
- scientific article; zbMATH DE number 3247810 (Why is no real title available?)
- scientific article; zbMATH DE number 3414220 (Why is no real title available?)
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A note on optimality conditions for bilevel programming problems∗
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel and multilevel programming: A bibliography review
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- Foundations of bilevel programming
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
- Global solution of bilevel programs with a nonconvex inner program
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Minimizing the Condition Number of a Gram Matrix
- Multiplier rules under mixed assumptions of differentiability and Lipschitz continuity
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- On the numerical solution of a class of Stackelberg problems
- Optimality conditions for bilevel programming problems
- Optimization and nonsmooth analysis
- Practical bilevel optimization. Algorithms and applications
- Projected gradient methods for linearly constrained problems
- Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
- Solving min-max problems and linear semi-infinite programs
- Stability of regularized bilevel programming problems
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- Variational Analysis
Cited in
(56)- A smoothing method for solving bilevel multiobjective programs with convex scalar program at the lower level
- BOLIB: bilevel Optimization LIBrary of test problems
- Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method
- Combining approximation and exact penalty in hierarchical programming
- Solving quadratic convex bilevel programming problems using a smoothing method
- Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization
- Bilevel optimal parameter learning for a high-order nonlocal multiframe super-resolution problem
- Single-level reformulations of a specific non-smooth bilevel programming problem and their applications
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
- scientific article; zbMATH DE number 7746334 (Why is no real title available?)
- Bilevel programming with convex lower level problems
- On bilevel programs with a convex lower-level problem violating Slater's constraint qualification
- Inner regularizations and viscosity solutions for pessimistic bilevel optimization problems
- A non-convex non-smooth bi-level parameter learning for impulse and Gaussian noise mixture removing
- A bilevel approach to ESG multi-portfolio selection
- Bilevel programming problems with simple convex lower level
- Solving semi-infinite programs by smoothing projected gradient method
- Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming
- Numerically tractable optimistic bilevel problems
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- Algorithmic schemes for non-smooth simple bilevel programming problem and simple MPEC problem
- Gauss-Newton-type methods for bilevel optimization
- Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
- Convexification method for bilevel programs with a nonconvex Follower's problem
- A modified homotopy method for solving the principal-agent bilevel programming problem
- scientific article; zbMATH DE number 6874493 (Why is no real title available?)
- Optimality conditions for bilevel programming: an approach through variational analysis
- A bi‐level programming framework for identifying optimal parameters in portfolio selection
- A non-convex denoising model for impulse and Gaussian noise mixture removing using bi-level parameter identification
- Solving ill-posed bilevel programs
- Techniques for gradient-based bilevel optimization with non-smooth lower level problems
- A bridge between bilevel programs and Nash games
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- Algorithms for simple bilevel programming
- A Lagrange multiplier expression method for bilevel polynomial optimization
- Geometric and computational hardness of bilevel programming
- Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems
- Near-optimal nonconvex-strongly-convex bilevel optimization with fully first-order oracles
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Learning nonlocal weights for second-order nonlocal super-resolution
- An approximation scheme for stochastic programs with second order dominance constraints
- Bilevel polynomial programs and semidefinite relaxation methods
- Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Bilevel optimization with convex majorant approach for training sparse neural networks
- Bilevel programming approaches to production planning for multiple products with short life cycles
- Gradient-based solution algorithms for a class of bilevel optimization and optimal control problems with a nonsmooth lower level
- A primal nonsmooth reformulation for bilevel optimization problems
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- Regularization and approximation methods in Stackelberg games and bilevel optimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Interactions between bilevel optimization and Nash games
- Stackelberg risk preference design
- An improved spatially controlled reaction-diffusion equation with a non-linear second order operator for image super-resolution
- On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
This page was built for publication: On solving simple bilevel programs with a nonconvex lower level program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452381)
