On solving simple bilevel programs with a nonconvex lower level program

DOI10.1007/s10107-013-0633-4zbMath1301.65050OpenAlexW1996676734MaRDI QIDQ2452381

Mengwei Xu, Jane J. Ye, Gui-Hua Lin

Publication date: 2 June 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-013-0633-4

zbMATH Keywords

algorithmconstrained optimizationvalue functionpartial calmnessnumerical resultsmoothing functionintegral entropy functionsmoothing projected gradient algorithmbilevel programgradient consistent property

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Related Items

A non-convex non-smooth bi-level parameter learning for impulse and Gaussian noise mixture removing ⋮ On bilevel programs with a convex lower-level problem violating Slater's constraint qualification ⋮ Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments ⋮ Solving ill-posed bilevel programs ⋮ Optimality Conditions for Bilevel Programming: An Approach Through Variational Analysis ⋮ A non-convex denoising model for impulse and Gaussian noise mixture removing using bi-level parameter identification ⋮ A modified homotopy method for solving the principal-agent bilevel programming problem ⋮ Inner regularizations and viscosity solutions for pessimistic bilevel optimization problems ⋮ A bridge between bilevel programs and Nash games ⋮ An improved spatially controlled reaction-diffusion equation with a non-linear second order operator for image super-resolution ⋮ Combining approximation and exact penalty in hierarchical programming ⋮ Numerically tractable optimistic bilevel problems ⋮ Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems ⋮ Bilevel Polynomial Programs and Semidefinite Relaxation Methods ⋮ A bilevel approach to ESG multi-portfolio selection ⋮ Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality ⋮ Bilevel programming approaches to production planning for multiple products with short life cycles ⋮ A bi‐level programming framework for identifying optimal parameters in portfolio selection ⋮ Single-level reformulations of a specific non-smooth bilevel programming problem and their applications ⋮ Bilevel optimal parameter learning for a high-order nonlocal multiframe super-resolution problem ⋮ Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization ⋮ Difference of convex algorithms for bilevel programs with applications in hyperparameter selection ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems ⋮ An approximation scheme for stochastic programs with second order dominance constraints ⋮ A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization ⋮ 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 ⋮ Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems ⋮ Gradient-Based Solution Algorithms for a Class of Bilevel Optimization and Optimal Control Problems with a Nonsmooth Lower Level ⋮ A smoothing augmented Lagrangian method for solving simple bilevel programs ⋮ Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs ⋮ Interactions Between Bilevel Optimization and Nash Games ⋮ Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization ⋮ BOLIB: Bilevel Optimization LIBrary of Test Problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method ⋮ Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming ⋮ On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game

Uses Software

• GradSamp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• Global solution of bilevel programs with a nonconvex inner program
• Practical bilevel optimization. Algorithms and applications
• Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
• Bilevel and multilevel programming: A bibliography review
• Stability of regularized bilevel programming problems
• Foundations of bilevel programming
• Solving min-max problems and linear semi-infinite programs
• Multiplier Rules Under Mixed Assumptions of Differentiability and Lipschitz Continuity
• Minimizing the Condition Number of a Gram Matrix
• 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
• Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
• Optimization and nonsmooth analysis
• Projected gradient methods for linearly constrained problems
• Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
• The Theory of Moral Hazard and Unobservable Behaviour: Part I
• A note on optimality conditions for bilevel programming problems^∗
• Variational Analysis
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• Optimality conditions for bilevel programming problems
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization