Nonconvex quasi-variational inequalities: stability analysis and application to numerical optimization

DOI10.1007/s10957-024-02582-4MaRDI QIDQ6667559

Joydeep Dutta, Lahoussine Lafhim, Sheng-Long Zhou, Alain B. Zemkoho

Publication date: 20 January 2025

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

zbMATH Keywords

stability analysisquasi-variational inequalitiesoptimal value functionsemismooth Newton methodoptimization problems with quasi-variational inequality constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of successive quadratic programming type (90C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniqueness for quasi-variational inequalities
• Variational analysis of marginal functions with applications to bilevel programming
• The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
• Properties and construction of NCP functions
• A relaxed constant positive linear dependence constraint qualification and applications
• Introduction to sensitivity and stability analysis in nonlinear programming
• Generalized Nash games and quasi-variational inequalities
• New uniform parametric error bounds
• Generalized differential calculus for nonsmooth and set-valued mappings
• A semismooth equation approach to the solution of nonlinear complementarity problems
• Foundations of bilevel programming
• A Newton method for a class of quasi-variational inequalities
• Gauss-Newton-type methods for bilevel optimization
• Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations 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
• Estimates of generalized hessians for optimal value functions in mathematical programming
• New sharp necessary optimality conditions for mathematical programs with equilibrium constraints
• A nonsmooth version of Newton's method
• Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
• On M-stationarity conditions in MPECs and the associated qualification conditions
• Weak and strong stationarity in generalized bilevel programming and bilevel optimal control
• Analysis of M-stationary points to an EPEC modeling oligopolistic competition in an electricity spot market
• On calmness conditions in convex bilevel programming
• Lipschitz Behavior of Solutions to Convex Minimization Problems
• Nash-Cournot Equilibria in Electric Power Markets with Piecewise Linear Demand Functions and Joint Constraints
• Coderivative Analysis of Quasi‐variational Inequalities with Applications to Stability and Optimization
• Some continuity properties of polyhedral multifunctions
• A mathematical programming approach for determining oligopolistic market equilibrium
• The Generalized Quasi-Variational Inequality Problem
• Semismooth and Semiconvex Functions in Constrained Optimization
• A special newton-type optimization method
• Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
• Variational Analysis
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• On the Calmness of a Class of Multifunctions
• Optimality conditions for bilevel programming problems
• BOLIB: Bilevel Optimization LIBrary of Test Problems
• Sufficient Optimality Conditions in Bilevel Programming
• Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
• On Lipschitz-like continuity of a class of set-valued mappings
• New necessary optimality conditions in optimistic bilevel programming
• New Constraint Qualifications for Mathematical Programs with Equilibrium Constraints via Variational Analysis
• A subdifferential condition for calmness of multifunctions
• Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization

This page was built for publication: Nonconvex quasi-variational inequalities: stability analysis and application to numerical optimization