One way to solve pessimistic bilevel optimization problems
From MaRDI portal
Cites work
- A line search exact penalty method using steering rules
- A Sufficient Condition for Exact Penalty in Constrained Optimization
- An approach to constrained global optimization based on exact penalty functions
- An Exact Penalization Viewpoint of Constrained Optimization
- Approximation of two-person games with information exchange
- Bilevel optimization. Advances and next challenges
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Bilevel programming with discrete lower level problems
- Computing B-stationary points of nonsmooth DC programs
- Convex Analysis
- Critical points of Lipschitz functions on smooth manifolds
- Error bounds and metric subregularity
- Exact penalty and error bounds in DC programming
- Exact penalty property in optimization with mixed constraints via variational analysis
- Existence and stability of exact penalty for optimization problems with mixed constraints
- Foundations of bilevel programming
- Frontiers in global optimization
- Generating Linear and Linear-Quadratic Bilevel Programming Problems
- Generating quadratic bilevel programming test problems
- Generic well-posedness of minimization problems with mixed smooth constraints
- Global optimality conditions and exact penalization
- Global optimality conditions in nonconvex optimization
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- scientific article; zbMATH DE number 4128662 (Why is no real title available?)
- scientific article; zbMATH DE number 757676 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3249572 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Local search for nonsmooth DC optimization with DC equality and inequality constraints
- Minimizing sequences in a constrained DC optimization problem
- New results on approximate solution in two-level optimization
- Non-Linear Programming Via Penalty Functions
- Nonlinear Programming
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- On solving optimization problems with hidden nonconvex structures
- On the continuity of the value of a linear program and of related polyhedral-valued multifunctions
- On the divergence of line search methods
- Optimization on metric and normed spaces
- Testing copositivity with the help of difference-of-convex optimization
- The BFGS method with exact line searches fails for non-convex objective functions
- The solution of a class of non-antagonistic games
- Three modeling paradigms in mathematical programming
This page was built for publication: One way to solve pessimistic bilevel optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876097)
