New necessary and sufficient optimality conditions for strong bilevel programming problems
type: Item
instance of: scholarly article
title: New necessary and sufficient optimality conditions for strong bilevel programming problems
zbMATH Open document ID: 1396.90061
author: Abdelmalek Aboussoror
author: Samir Adly
published in: Journal of Global Optimization
publication date: 2018-03-01T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 91A65
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6845606
zbMATH Keywords: two-level optimization
zbMATH Keywords: convergence of multifunctions
zbMATH Keywords: reverse convex problems
zbMATH Keywords: global optimization tools
MaRDI profile type: Publication
full work available at URL: s10898-018-0606-5
OpenAlex ID: W2793029537
cites work: Existence and approximation results involving regularized constrained Stackelberg problems
cites work: Q4837999
cites work: Q4663895
cites work: Weak linear bilevel programming problems: existence of solutions via a penalty method
cites work: Q3517225
cites work: Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting
cites work: Q3968042
cites work: Sequential Stackelberg equilibria in two-person games
cites work: New necessary optimality conditions in optimistic bilevel programming
cites work: Second order optimality conditions for bilevel set optimization problems
cites work: The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
cites work: A linear max—min problem
cites work: Q4164014
cites work: On generalized Stackelberg strategies
cites work: Topological existence and stability for min sup problems
cites work: Stability of regularized bilevel programming problems
cites work: Q4016645
cites work: Existence theorems of equilibrium points in stackelberg
cites work: Q3795499
cites work: On the numerical solution of a class of Stackelberg problems
cites work: Convex Analysis
cites work: Necessary conditions for min-max problems and algorithms by a relaxation procedure
cites work: Q4332850
cites work: Convex programs with an additional reverse convex constraint
cites work: On the global minimization of a convex function under general nonconvex constraints
cites work: New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
DOI: 10.1007/S10898-018-0606-5
description: scientific article; zbMATH DE number 6845606