Further study on two fixed point iterative schemes for absolute value equations

DOI10.1007/s40314-024-03032-7MaRDI QIDQ6659784

Jiayu Liu, Cai-Rong Chen, [[Person:6178383|Author name not available (Why is that?)]]

Publication date: 9 January 2025

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

zbMATH Keywords

convergenceiterative methodunique solvabilityabsolute value equationsoptimal iteration parameter

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Unsupervised and semisupervised classification via absolute value inequalities
• On the global convergence of the inexact semi-smooth Newton method for absolute value equation
• The Picard-HSS iteration method for absolute value equations
• A dynamic model to solve the absolute value equations
• Bounds for the solutions of absolute value equations
• On unique solvability of the absolute value equation
• Systems of linear interval equations
• Absolute value equations
• Absolute value programming
• A generalized Newton method for absolute value equations
• Global and finite convergence of a generalized Newton method for absolute value equations
• A generalization of the Gauss-Seidel iteration method for solving absolute value equations
• SOR-like iteration method for solving absolute value equations
• Minimum norm solution to the absolute value equation in the convex case
• A note on absolute value equations
• An inverse-free dynamical system for solving the absolute value equations
• A new concave minimization algorithm for the absolute value equation solution
• Two new fixed point iterative schemes for absolute value equations
• Method of alternating projections for the general absolute value equation
• A new SOR-like method for solving absolute value equations
• The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
• A note on unique solvability of the absolute value equation
• On the SOR-like iteration method for solving absolute value equations
• An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem
• An iterative method for solving absolute value equations and sufficient conditions for unique solvability
• Linear complementarity as absolute value equation solution
• Absolute value equation solution via concave minimization
• On equivalent reformulations for absolute value equations
• Some notes on the solvability conditions for absolute value equations
• Relaxed-based matrix splitting methods for solving absolute value equations
• Error bounds and a condition number for the absolute value equations
• Parallel iterative methods for sparse linear systems
• The modulus-based matrix splitting algorithms for a class of weakly nonlinear complementarity problems.
• A theorem of the alternatives for the equationAx+B|x| =b
• Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes
• Exact and inexact Douglas–Rachford splitting methods for solving large-scale sparse absolute value equations
• On finite termination of the generalized Newton method for solving absolute value equations
• A modified generalized SOR-like method for solving an absolute value equation
• New backward error bounds of Rayleigh–Ritz projection methods for quadratic eigenvalue problem
• Optimal parameter of the SOR-like iteration method for solving absolute value equations
• On perturbations for spectrum and singular value decompositions followed by deflation techniques

This page was built for publication: Further study on two fixed point iterative schemes for absolute value equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659784)