A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities

DOI10.1007/s11425-011-4192-yzbMath1237.65063OpenAlexW2043971357MaRDI QIDQ657283

Jia Wu, Li-wei Zhang

Publication date: 16 January 2012

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-011-4192-y

zbMATH Keywords

numerical resultsquadratic convergencesmoothing Newton methodoptimality conditions, single-valued Lipschitz continuous mapping, multipliers, necessary optimality conditionsparametrized quasi-variational inequality

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Variational inequalities (49J40) Numerical methods based on nonlinear programming (49M37) Numerical methods for variational inequalities and related problems (65K15)

Related Items

An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities, A Short State of the Art on Multi-Leader-Follower Games

Uses Software

• OPECgen

Cites Work

• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• Generalized Nash games and quasi-variational inequalities
• Uniqueness results and algorithm for Stackelberg-Cournot-Nash equilibria
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
• Solution of monotone complementarity problems with locally Lipschitzian functions
• A smoothing method for a mathematical program with P-matrix linear complementarity constraints
• A numerical approach to optimization problems with variational inequality constraints
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• A nonsmooth version of Newton's method
• Coderivative Analysis of Quasi‐variational Inequalities with Applications to Stability and Optimization
• Optimization and nonsmooth analysis
• Network design problem with congestion effects: A case of bilevel programming
• Semismooth and Semiconvex Functions in Constrained Optimization
• A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Unnamed Item
• Unnamed Item