A Jacobian smoothing method for box constrained variational inequality problems
DOI10.1016/j.amc.2004.03.018zbMath1068.65089OpenAlexW1989239717MaRDI QIDQ1765876
Publication date: 23 February 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2004.03.018
algorithmglobal convergencevariational inequalitynumerical experimentsbox constraintsnonlinear complementarity problemobstacle problemsuperlinear convergencesmoothing method
Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A nonsmooth Newton method for variational inequalities. II: Numerical results
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A new approach to continuation methods for complementarity problems with uniform \(P\)-functions
- A nonsmooth version of Newton's method
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- Computing a Trust Region Step
- A special newton-type optimization method
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Iterative methods for linear complementarity problems with upperbounds on primary variables
- A new strategy for solving variational inequalities in bounded polytopes∗
This page was built for publication: A Jacobian smoothing method for box constrained variational inequality problems
