scientific article; zbMATH DE number 770227
From MaRDI portal
Publication:4837999
zbMath0834.90111MaRDI QIDQ4837999
Pierre Loridan, Abdelmalek Aboussoror
Publication date: 4 February 1996
Full work available at URL: https://eudml.org/doc/11664
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
two-level optimization\(\varepsilon\)- approximate optimal solutionsstrong-weak Stackelberg problemssystem of nondifferentiable convex inequalities
Convex programming (90C25) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52)
Related Items
Softening bilevel problems via two-scale Gibbs measures ⋮ A survey on bilevel optimization under uncertainty ⋮ New necessary and sufficient optimality conditions for strong bilevel programming problems ⋮ On Bilevel Optimization with Inexact Follower ⋮ Min-max and min-min Stackelberg strategies with closed-loop information structure ⋮ A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem ⋮ On a class of bilevel linear mixed-integer programs in adversarial settings ⋮ Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting ⋮ A new method for strong-weak linear bilevel programming problem ⋮ Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization ⋮ Methods for Pessimistic Bilevel Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Optimality conditions for pessimistic semivectorial bilevel programming problems
This page was built for publication:
