Generic Property of the Partial Calmness Condition for Bilevel Programming Problems
DOI10.1137/20M1371403zbMath1491.90129arXiv2107.14469OpenAlexW3192612355MaRDI QIDQ5072592
No author found.
Publication date: 29 April 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.14469
optimality conditionsgeneric propertybilevel programmingpartial calmnessgeneralized equationpartial error bound
Nonconvex programming, global optimization (90C26) Hierarchical games (including Stackelberg games) (91A65) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Variational analysis of marginal functions with applications to bilevel programming
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- The deregulated electricity market viewed as a bilevel programming problem
- Multitask principal-agent problems: Optimal contracts, fragility, and effort misallocation
- Partial exact penalty for mathematical programs with equilibrium constraints
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Practical bilevel optimization. Algorithms and applications
- Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
- Foundations of bilevel programming
- Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems
- Bilevel optimization: on the structure of the feasible set
- Solving bilevel programs with the KKT-approach
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- New sharp necessary optimality conditions for mathematical programs with equilibrium constraints
- Bilevel optimization. Advances and next challenges
- On M-stationarity conditions in MPECs and the associated qualification conditions
- On intrinsic complexity of Nash equilibrium problems and bilevel optimization
- On calmness conditions in convex bilevel programming
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- Necessary Optimality Conditions for Multiobjective Bilevel Programs
- On the numerical solution of a class of Stackelberg problems
- On Reducibility in Bilevel Problems
- Two New Conditions Supporting the First-Order Approach to Multisignal Principal-Agent Problems
- Optimization and nonsmooth analysis
- Critical sets in parametric optimization
- Aggregation and Linearity in the Provision of Intertemporal Incentives
- An Analysis of the Principal-Agent Problem
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Variational Analysis
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Variational Analysis and Applications
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- On the Calmness of a Class of Multifunctions
- Optimality conditions for bilevel programming problems
- Bilevel Optimization and Variational Analysis
- Constraint Qualifications and Optimality Conditions in Bilevel Optimization
- A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization
- Bilevel Programming Problems
- On the Classical Necessary Second-Order Optimality Conditions in the Presence of Equality and Inequality Constraints
- Bilevel Polynomial Programs and Semidefinite Relaxation Methods
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- New necessary optimality conditions in optimistic bilevel programming
- Classification model selection via bilevel programming
- How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
- New Constraint Qualifications for Mathematical Programs with Equilibrium Constraints via Variational Analysis
- Two Consequences of the Transposition Theorem on Linear Inequalities
This page was built for publication: Generic Property of the Partial Calmness Condition for Bilevel Programming Problems
