On bilevel programs with a convex lower-level problem violating Slater's constraint qualification
type: Item
instance of: scholarly article
title: On bilevel programs with a convex lower-level problem violating Slater's constraint qualification
zbMATH Open document ID: 1402.90190
author: Gaoxi Li
author: Zhongping Wan
published in: Journal of Optimization Theory and Applications
publication date: 2018-11-27T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6985496
zbMATH Keywords: nonlinear programs
zbMATH Keywords: bilevel programs
zbMATH Keywords: Slater's constraint qualification
zbMATH Keywords: complementarity constraints
zbMATH Keywords: lower convergence
MaRDI profile type: Publication
full work available at URL: s10957-018-1392-4
OpenAlex ID: W2891559984
cites work: Practical bilevel optimization. Algorithms and applications
cites work: An inexact-restoration method for nonlinear bilevel programming problems
cites work: An overview of bilevel optimization
cites work: Bilevel Programming Problems
cites work: Q5144442
cites work: A penalty function method for solving weak price control problem
cites work: Global solution of bilevel programs with a nonconvex inner program
cites work: Bilevel and multilevel programming: A bibliography review
cites work: A globally convergent algorithm for a class of bilevel nonlinear programming problem
cites work: A smoothing augmented Lagrangian method for solving simple bilevel programs
cites work: Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
cites work: Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
cites work: On the numerical solution of a class of Stackelberg problems
cites work: A note on optimality conditions for bilevel programming problems∗
cites work: On solving simple bilevel programs with a nonconvex lower level program
cites work: Solving bilevel programs with the KKT-approach
cites work: The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
cites work: On calmness conditions in convex bilevel programming
cites work: Is bilevel programming a special case of a mathematical program with complementarity constraints?
cites work: Necessary Optimality Conditions for Multiobjective Bilevel Programs
cites work: Stability of regularized bilevel programming problems
cites work: Point-to-Set Maps in Mathematical Programming
cites work: Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming
cites work: Variational Analysis
cites work: Convergences of marginal functions with dependent constraints
cites work: An investigation of the linear three level programming problem
cites work: Solving mathematical programs with equilibrium constraints
cites work: Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
cites work: A new regularization method for mathematical programs with complementarity constraints with strong convergence properties
cites work: Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
cites work: A Non-Interior-Point Continuation Method for Linear Complementarity Problems
cites work: A special newton-type optimization method
cites work: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
Wikidata QID: Q129247671
DOI: 10.1007/S10957-018-1392-4
description: scientific article; zbMATH DE number 6985496