A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities
DOI10.1007/S11425-011-4192-YzbMATH Open1237.65063OpenAlexW2043971357MaRDI QIDQ657283FDOQ657283
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
Recommendations
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities
- The semismooth Newton method for the solution of quasi-variational inequalities
- A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
- A regularized smoothing Newton-type algorithm for quasi-variational inequalities
- A smoothing method for mathematical programs with equilibrium constraints
numerical resultsquadratic convergencesmoothing Newton methodoptimality conditions, single-valued Lipschitz continuous mapping, multipliers, necessary optimality conditionsparametrized quasi-variational inequality
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Variational inequalities (49J40) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- A nonsmooth version of Newton's method
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Generalized Nash games and quasi-variational inequalities
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- Coderivative Analysis of Quasi‐variational Inequalities with Applications to Stability and Optimization
- Network design problem with congestion effects: A case of bilevel programming
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- Title not available (Why is that?)
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Uniqueness results and algorithm for Stackelberg-Cournot-Nash equilibria
- Title not available (Why is that?)
- A smoothing method for a mathematical program with P-matrix linear complementarity constraints
- A numerical approach to optimization problems with variational inequality constraints
Cited In (5)
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
- A parameterized Newton method and a quasi-Newton method for nonsmooth equations
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities
- Title not available (Why is that?)
- A Short State of the Art on Multi-Leader-Follower Games
Uses Software
This page was built for publication: A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657283)
