Direct algorithm for the solution of two-sided obstacle problems with M -matrix

DOI10.1002/nla.726zbMath1249.65136OpenAlexW2133319551MaRDI QIDQ2889377

YingJun Jiang, Jin-ping Zeng

Publication date: 7 June 2012

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.726

zbMATH Keywords

\(M\)-matrixdirect algorithmtwo-sided obstacle problempolynomial computational complexity

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Existence theories for optimal control problems involving ordinary differential equations (49J15) Complexity and performance of numerical algorithms (65Y20)

Related Items (3)

The reduced order method for solving the linear complementarity problem with an \(M\)-matrix ⋮ Quadratic convergence of monotone iterates for semilinear elliptic obstacle problems ⋮ The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal quadratic programming algorithms. With applications to variational inequalities
• Two-side obstacle problem and its equivalent linear complementarity problem
• Gaussian pivoting method for solving linear complementarity problem
• Direct algorithms to solve the two-sided obstacle problem for anM-matrix
• Minkowski matrices.
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A generalization of the linear complementarity problem

This page was built for publication: Direct algorithm for the solution of two-sided obstacle problems with M -matrix