Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem

DOI10.1016/j.amc.2006.11.126zbMath1128.65049MaRDI QIDQ2383838

Lihua Jiang, Chang-Feng Ma

Publication date: 19 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.11.126

zbMATH Keywords

global convergence; linear complementarity problem; superlinear convergence; Broyden-like method; line search technique; Bi-obstacle problem

Mathematics Subject Classification ID

65K10: Numerical optimization and variational techniques

49J40: Variational inequalities

49M37: Numerical methods based on nonlinear programming

Related Items

A new modified one-step smoothing Newton method for solving the general mixed complementarity problem, A new smoothing Broyden-like method for solving the mixed complementarity problem with a \(P_{0}\)-function

Cites Work

• Unnamed Item
• 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
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
• Newton's Method for B-Differentiable Equations
• The “global” convergence of Broyden-like methods with suitable line search
• Quasi-Newton Methods, Motivation and Theory