Method of alternating projections for the general absolute value equation
From MaRDI portal
Publication:2111941
DOI10.1007/s11784-022-01026-8OpenAlexW4313531411MaRDI QIDQ2111941
Matthew K. Tam, Jein-Shan Chen, Jan Harold Alcantara
Publication date: 17 January 2023
Published in: Journal of Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.03268
Related Items
Smoothing Levenberg-Marquardt algorithm for solving non-Lipschitz absolute value equations, Absolute value equations with data uncertainty in the $l_1$ and $l_\infty$ norm balls, Modulus-based matrix splitting methods for complex linear complementarity problem, On finite termination of the generalized Newton method for solving absolute value equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the global convergence of the inexact semi-smooth Newton method for absolute value equation
- Regularity properties of non-negative sparsity sets
- The Picard-HSS iteration method for absolute value equations
- On generalized Traub's method for absolute value equations
- A hybrid algorithm for solving the absolute value equation
- A globally and quadratically convergent method for absolute value equations
- Properties and construction of NCP functions
- Reflection-projection method for convex feasibility problems with an obtuse cone
- Algorithms based on unions of nonexpansive maps
- Systems of linear interval equations
- Local linear convergence for alternating and averaged nonconvex projections
- 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
- Numerical comparisons based on four smoothing functions for absolute value equation
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A note on absolute value equations
- On construction of new NCP functions
- A note on unique solvability of the absolute value equation
- Solving absolute value equation using complementarity and smoothing functions
- Union averaged operators with applications to proximal algorithms for MIN-convex functions
- An iterative method for solving absolute value equations and sufficient conditions for unique solvability
- Absolute value equation solution via concave minimization
- On the local convergence of the Douglas-Rachford algorithm
- Complementary pivot theory of mathematical programming
- On equivalent reformulations for absolute value equations
- Introduction to Piecewise Differentiable Equations
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- A theorem of the alternatives for the equationAx+B|x| =b
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
