On tridiagonal linear complementarity problems
From MaRDI portal
Publication:1095609
DOI10.1007/BF01399692zbMath0632.65078OpenAlexW2055849751MaRDI QIDQ1095609
Publication date: 1987
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133182
iterative algorithmNewton's methodlinear complementarity problemssuperlinear convergenceconjugate duality theorystrictly convex quadratic programsunconstrained dual problem
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
An unconstrained dual program for computing convex \(C^ 1\)-spline approximants, Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation, Determination of shape preserving spline interpolants with minimal curvature via dual programs, A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems, A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines, Unconstrained duals to partially separable constrained programs
Cites Work
- Unnamed Item
- A multilevel iterative method for symmetric, positive definite linear complementarity problems
- Convex spline interpolants with minimal curvature
- Determination of shape preserving spline interpolants with minimal curvature via dual programs
- Komplementaritäts- und Fixpunktalgorithmen in der mathematischen Programmierung, Spieltheorie und Ökonomie
- On the solution of large, structured linear complementarity problems: The tridiagonal case
- Multigrid Algorithms for the Solution of Linear Complementarity Problems Arising from Free Boundary Problems
- Convex Analysis
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- The Method of Christopherson for Solving Free Boundary Problems for Infinite Journal Bearings by Means of Finite Differences