On bilevel programs with a convex lower-level problem violating Slater's constraint qualification

DOI10.1007/S10957-018-1392-4zbMath1402.90190OpenAlexW2891559984WikidataQ129247671 ScholiaQ129247671MaRDI QIDQ1626528

Gaoxi Li, Zhong-Ping Wan

Publication date: 27 November 2018

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-018-1392-4

zbMATH Keywords

nonlinear programscomplementarity constraintsbilevel programsSlater's constraint qualificationlower convergence

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (3)

Convexification method for bilevel programs with a nonconvex Follower's problem ⋮ Stability for semivectorial bilevel programs ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Solving mathematical programs with equilibrium constraints
• The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• A smoothing augmented Lagrangian method for solving simple bilevel programs
• An inexact-restoration method for nonlinear bilevel programming problems
• A penalty function method for solving weak price control problem
• Global solution of bilevel programs with a nonconvex inner program
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• Practical bilevel optimization. Algorithms and applications
• Bilevel and multilevel programming: A bibliography review
• Stability of regularized bilevel programming problems
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
• Solving bilevel programs with the KKT-approach
• A globally convergent algorithm for a class of bilevel nonlinear programming problem
• On solving simple bilevel programs with a nonconvex lower level program
• An overview of bilevel optimization
• A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
• On calmness conditions in convex bilevel programming
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• Necessary Optimality Conditions for Multiobjective Bilevel Programs
• On the numerical solution of a class of Stackelberg problems
• An investigation of the linear three level programming problem
• The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
• Convergences of marginal functions with dependent constraints
• A special newton-type optimization method
• A note on optimality conditions for bilevel programming problems^∗
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• Variational Analysis
• Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
• Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming
• Bilevel Programming Problems
• Point-to-Set Maps in Mathematical Programming

This page was built for publication: On bilevel programs with a convex lower-level problem violating Slater's constraint qualification