Sufficient optimality conditions in bilevel programming
From MaRDI portal
bilevel optimizationsecond-order directional derivativessecond-order sufficient optimality conditionsfirst-order sufficient optimality conditions
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Set-valued and variational analysis (49J53)
Abstract: This paper is concerned with the derivation of first- and second-order sufficient optimality conditions for optimistic bilevel optimization problems involving smooth functions. First-order sufficient optimality conditions are obtained by estimating the tangent cone to the feasible set of the bilevel program in terms of initial problem data. This is done by exploiting several different reformulations of the hierarchical model as a single-level problem. To obtain second-order sufficient optimality conditions, we exploit the so-called value function reformulation of the bilevel optimization problem, which is then tackled with the aid of second-order directional derivatives. The resulting conditions can be stated in terms of initial problem data in several interesting situations comprising the settings where the lower level is linear or possesses strongly stable solutions.
Recommendations
- Optimality conditions for bilevel programming problems
- Optimality conditions for bilevel programming: an approach through variational analysis
- New necessary optimality conditions in optimistic bilevel programming
- First- and second-order optimality conditions in optimistic bilevel set-valued programming
- scientific article; zbMATH DE number 432976
Cites work
- scientific article; zbMATH DE number 1727434 (Why is no real title available?)
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 1334326 (Why is no real title available?)
- scientific article; zbMATH DE number 978735 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- A necessary and a sufficient optimality condition for bilevel programming problems
- A relaxed constant positive linear dependence constraint qualification and applications
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Calmness of constraint systems with applications
- Directional derivative of the marginal function in nonlinear programming
- Directional derivatives of the solution of a parametric nonlinear program
- Exact penalty functions in nonlinear programming
- First order optimality conditions for generalized semi-infinite programming problems
- Foundations of bilevel programming
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Introduction to sensitivity and stability analysis in nonlinear programming
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Lipschitz and Hölder stability of optimization problems and generalized equations
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- New necessary and sufficient optimality conditions for strong bilevel programming problems
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- On LICQ and the uniqueness of Lagrange multipliers
- On calmness conditions in convex bilevel programming
- On computation of generalized derivatives of the normal-cone mapping and their applications
- On concepts of directional differentiability
- On the linear independence constraint qualification in disjunctive programming
- On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
- Optimality conditions for bilevel programming problems
- Optimality conditions for bilevel programming problems
- Optimization and nonsmooth analysis
- Parabolic regularity in geometric variational analysis
- Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton
- Practical bilevel optimization. Algorithms and applications
- Second Order Conditions for Constrained Minima
- Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets
- Second order optimality conditions for bilevel set optimization problems
- Second-Order Conditions for Optimization Problems with Constraints
- Second-Order Variational Analysis of Parametric Constraint and Variational Systems
- Second-order and related extremality conditions in nonlinear programming
- Second-order optimality conditions in generalized semi-infinite programming
- Sensitivity Analysis of Nonlinear Programs and Differentiability Properties of Metric Projections
- Sensitivity analysis for two-level value functions with applications to bilevel programming
- Sensitivity analysis of the value function for parametric mathematical programs with equilibrium constraints
- Some continuity properties of polyhedral multifunctions
- Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Variational Analysis
- Variational analysis and applications
Cited in
(29)- Bilevel optimization: reformulation and first optimality conditions
- First- and second-order optimality conditions in optimistic bilevel set-valued programming
- Necessary optimality conditions in pessimistic bilevel programming
- A note on the optimality condition for a bilevel programming
- scientific article; zbMATH DE number 432976 (Why is no real title available?)
- scientific article; zbMATH DE number 4159489 (Why is no real title available?)
- Necessary Conditions for Bilevel Dynamic Optimization Problems
- Second order optimality conditions for bilevel set optimization problems
- scientific article; zbMATH DE number 7733454 (Why is no real title available?)
- Linearly convergent bilevel optimization with single-step inner methods
- Sensitivity analysis for two-level value functions with applications to bilevel programming
- Semivectorial bilevel optimization on affine-Finsler-metric manifolds
- scientific article; zbMATH DE number 1931010 (Why is no real title available?)
- Linear bilevel programming with upper level constraints depending on the lower level solution
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- Optimality conditions for special semidefinite bilevel optimization problems
- Sufficient optimality conditions for a bilevel semivectorial D.C. problem
- Constraint qualifications and optimality conditions in bilevel optimization
- Optimality conditions for nondifferentiable interval-valued bilevel optimization problems via tangential subdifferentials
- Second order optimality conditions for a bilevel optimization problem in terms of approximate Hessians
- New optimality conditions for bilevel programs by using an exact separation principle
- Optimality conditions for the bilevel programming problem
- Nonconvex quasi-variational inequalities: stability analysis and application to numerical optimization
- New necessary and sufficient optimality conditions for strong bilevel programming problems
- A fresh look at nonsmooth Levenberg–Marquardt methods with applications to bilevel optimization
- Second-order optimality conditions for bi-local solutions of bilevel programs
- Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem
- Optimality conditions for a bilevel matroid problem
- First and second order optimality conditions of a class of bilevel programming problems in Hilbert spaces
This page was built for publication: Sufficient optimality conditions in bilevel programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5026452)
