KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization

DOI10.1137/130917715zbMath1327.90377OpenAlexW2080478657MaRDI QIDQ5245361

Publication date: 8 April 2015

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/370786/1/Nonsmooth%2520KKT.pdf

zbMATH Keywords

optimality conditions coderivative variational analysis constraint qualifications stationarity conditions nonsmooth bilevel optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (21)

Some new optimality conditions for semivector bilevel optimization program ⋮ A new approach to solve convex infinite-dimensional bilevel problems: application to the pollution emission price problem ⋮ Solving ill-posed bilevel programs ⋮ Optimality conditions for nonsmooth equilibrium problems via Hadamard directional derivative ⋮ Estimates of generalized hessians for optimal value functions in mathematical programming ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ Optimality conditions for nonsmooth multiobjective bilevel optimization problems ⋮ Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems ⋮ The structure of optimal parameters for image restoration problems ⋮ Focus programming: a bi‐level programming approach to static stochastic optimization problems ⋮ Single-level reformulations of a specific non-smooth bilevel programming problem and their applications ⋮ An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach ⋮ Variational Methods for Emerging Real–Life and Environmental Conservation Problems ⋮ A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem ⋮ Robust strategic bidding in auction-based markets ⋮ A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs ⋮ Gradient-Based Solution Algorithms for a Class of Bilevel Optimization and Optimal Control Problems with a Nonsmooth Lower Level ⋮ Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming ⋮ Bilevel Optimization and Variational Analysis ⋮ MPEC Methods for Bilevel Optimization Problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

This page was built for publication: KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization