Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs

DOI10.1007/s10898-020-00907-xzbMath1447.49031arXiv1912.12372OpenAlexW3023286594MaRDI QIDQ2200089

Jane J. Ye, Mengwei Xu

Publication date: 15 September 2020

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.12372

zbMATH Keywords

constraint qualificationvariational analysisRCPLDbilevel programerror bound propertycomplementarity systemnonsmooth program

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (11)

Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming ⋮ Directional Necessary Optimality Conditions for Bilevel Programs ⋮ An augmented Lagrangian method for optimization problems with structured geometric constraints ⋮ First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition ⋮ Relaxed constant positive linear dependence constraint qualification for disjunctive systems ⋮ Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints ⋮ Unnamed Item ⋮ A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization ⋮ Optimality conditions and exact penalty for mathematical programs with switching constraints ⋮ Constraint Qualifications and Optimality Conditions in Bilevel Optimization ⋮ R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Second-order optimality conditions for mathematical programs with equilibrium constraints
• Variational analysis of marginal functions with applications to bilevel programming
• New results on constraint qualifications for nonlinear extremum problems and extensions
• A relaxed constant positive linear dependence constraint qualification and applications
• On the relation between constant positive linear dependence condition and quasinormality constraint qualification
• The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
• Notes on some constraint qualifications for mathematical programs with equilibrium constraints
• Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
• Sensitivity Analysis of the Value Function for Parametric Mathematical Programs with Equilibrium Constraints
• An augmented Lagrangian trust region method for equality constrained optimization
• An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming
• New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
• Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results
• On relaxed constant rank regularity condition in mathematical programming
• The approximate subdifferential of composite functions
• Necessary Optimality Conditions for Multiobjective Bilevel Programs
• On the numerical solution of a class of Stackelberg problems
• Directional derivative of the marginal function in nonlinear programming
• Optimization and nonsmooth analysis
• Differential properties of the marginal function in mathematical programming
• The Theory of Moral Hazard and Unobservable Behaviour: Part I
• Variational Analysis
• Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• Variational Analysis and Applications
• Optimality conditions for bilevel programming problems
• Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints
• New necessary optimality conditions in optimistic bilevel programming

This page was built for publication: Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs