A nonsmooth Newton method for variational inequalities. I: Theory
DOI10.1007/BF01581695zbMath0812.65048MaRDI QIDQ1334958
Patrick T. Harker, Baichun Xiao
Publication date: 26 September 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
variational inequalities; numerical examples; nonlinear complementarity problems; nonlinear programs; locally quadratic convergence; nonsmooth Newton method; damped Newton algorithm
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
65K10: Numerical optimization and variational techniques
49J40: Variational inequalities
49M15: Newton-type methods
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- A note on a globally convergent Newton method for solving monotone variational inequalities
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- On multilevel iterative methods for optimization problems
- On concepts of directional differentiability
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- On the maximal monotonicity of subdifferential mappings
- Newton's Method for B-Differentiable Equations
- A relaxed projection method for variational inequalities
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Iterative methods for variational and complementarity problems
- Monotone Operators and the Proximal Point Algorithm
- Inexact Newton methods for the nonlinear complementarity problem
- Proximité et dualité dans un espace hilbertien