Convexification method for bilevel programs with a nonconvex Follower's problem
type: Item
instance of: scholarly article
title: Convexification method for bilevel programs with a nonconvex Follower's problem
zbMATH Open document ID: 1469.90112
author: Yanyan Li
published in: Journal of Optimization Theory and Applications
publication date: 2021-06-15T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 7359101
zbMATH Keywords: bilevel program
zbMATH Keywords: equilibrium constraint
zbMATH Keywords: global optimization
zbMATH Keywords: piecewise convexification
MaRDI profile type: Publication
full work available at URL: s10957-020-01804-9
OpenAlex ID: W3118514307
cites work: Practical bilevel optimization. Algorithms and applications
cites work: Foundations of bilevel programming
cites work: Q4332850
cites work: On the numerical solution of a class of Stackelberg problems
cites work: A note on optimality conditions for bilevel programming problems∗
cites work: On solving simple bilevel programs with a nonconvex lower level program
cites work: Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
cites work: On bilevel programs with a convex lower-level problem violating Slater's constraint qualification
cites work: Semivectorial bilevel programming versus scalar bilevel programming
cites work: The Theory of Moral Hazard and Unobservable Behaviour: Part I
cites work: Is bilevel programming a special case of a mathematical program with complementarity constraints?
cites work: Solving bilevel programs with the KKT-approach
cites work: An overview of bilevel optimization
cites work: The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
cites work: On calmness conditions in convex bilevel programming
cites work: New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
cites work: A smoothing method for mathematical programs with equilibrium constraints
cites work: Solving mathematical programs with equilibrium constraints
cites work: Sensitivity Analysis of the Value Function for Parametric Mathematical Programs with Equilibrium Constraints
cites work: Mathematical Programs with Equilibrium Constraints
cites work: Optimality Conditions for Optimization Problems with Complementarity Constraints
cites work: Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
cites work: Deterministic global optimization. Theory, methods and applications
cites work: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
cites work: The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
cites work: Stability of regularized bilevel programming problems
cites work: Point-to-Set Maps in Mathematical Programming
cites work: Q4503250
cites work: New NCP-functions and their properties
cites work: Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
cites work: Some Noninterior Continuation Methods for Linear Complementarity Problems
DOI: 10.1007/S10957-020-01804-9
description: scientific article; zbMATH DE number 7359101