An inexact NE/SQP method for solving the nonlinear complementarity problem
DOI10.1007/BF00247654zbMath0794.90071OpenAlexW2052822180MaRDI QIDQ1202586
Steven A. Gabriel, Jong-Shi Pang
Publication date: 14 February 1993
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00247654
linear complementarityapproximate solutionssequential quadratic programmingnonsmooth equationsmatrix splittingequilibrium programmingnonlinear complementarityinexact methodquadratic program subproblems
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Cites Work
- Unnamed Item
- A multi-grid continuation strategy for parameter-dependent variational inequalities
- Continuation for parametrized nonlinear variational inequalities
- Two-stage parallel iterative methods for the symmetric linear complementarity problem
- An inexact NE/SQP method for solving the nonlinear complementarity problem
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Newton's Method for B-Differentiable Equations
- On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- Inexact Newton Methods
- Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- Inexact Newton methods for the nonlinear complementarity problem
- Convergence Properties of Iterative Methods for Symmetric Positive Semidefinite Linear Complementarity Problems