Outer approximation for convex MINLPs can cycle due to CQ failures or approximate solves, but extended cutting planes ensure finite convergence under weaker constraint qualification assumptions.
Necessary optimality condi- tions in pessimistic bilevel programming
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
math.OC 4representative citing papers
Pessimistic linear bilevel optimization problems with coupling constraints are equivalent to pessimistic and optimistic versions without them.
Derives second-order Dini formulas for efficient solution maps S from marginal maps Φ under value-to-decision error bounds and metric regularity conditions in parametric vector optimization.
A variable-metric non-monotone line search method based on the Fukushima regularized gap function is introduced for mixed variational inequalities and equilibrium problems, with global convergence and R-linear rate proved under strong monotonicity.
citing papers explorer
-
On Coupling Constraints in Pessimistic Linear Bilevel Optimization
Pessimistic linear bilevel optimization problems with coupling constraints are equivalent to pessimistic and optimistic versions without them.