Solving absolute value equation using complementarity and smoothing functions
From MaRDI portal
Publication:2402395
DOI10.1016/j.cam.2017.06.019zbMath1370.90297OpenAlexW2225225175MaRDI QIDQ2402395
L. Abdallah, Mounir Haddou, Tangi Migot
Publication date: 7 September 2017
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2017.06.019
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods of relaxation type (49M20)
Related Items
A two-step Newton-type method for solving system of absolute value equations ⋮ On Picard-SHSS iteration method for absolute value equation ⋮ Two new iteration methods with optimal parameters for solving absolute value equations ⋮ An improvement on a class of fixed point iterative methods for solving absolute value equations ⋮ Iterative schemes induced by block splittings for solving absolute value equations ⋮ On the solution of general absolute value equations ⋮ A sub-additive DC approach to the complementarity problem ⋮ A new SOR-like method for solving absolute value equations ⋮ Smoothing Levenberg-Marquardt algorithm for solving non-Lipschitz absolute value equations ⋮ A smoothing method for sparse optimization over convex sets ⋮ 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 ⋮ Smoothing techniques in solving non-Lipschitz absolute value equations ⋮ The new iteration methods for solving absolute value equations. ⋮ Error bounds and a condition number for the absolute value equations ⋮ An inertial inverse-free dynamical system for solving absolute value equations ⋮ The solution of a type of absolute value equations using two new matrix splitting iterative techniques ⋮ Unnamed Item ⋮ An inverse-free dynamical system for solving the absolute value equations ⋮ A numerical method based on the complementarity and optimal control formulations for solving a family of zero-sum pursuit-evasion differential games ⋮ A new two-step iterative method for solving absolute value equations ⋮ Modified HS conjugate gradient method for solving generalized absolute value equations ⋮ A new class of neural networks for NCPs using smooth perturbations of the natural residual function ⋮ Absolute value equations with tensor product structure: unique solvability and numerical solution. ⋮ Two new fixed point iterative schemes for absolute value equations ⋮ Method of alternating projections for the general absolute value equation ⋮ The solution of the absolute value equations using two generalized accelerated overrelaxation methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the global convergence of the inexact semi-smooth Newton method for absolute value equation
- An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side
- Absolute value equation solution via linear programming
- The Picard-HSS iteration method for absolute value equations
- A globally and quadratically convergent method for absolute value equations
- Some techniques for solving absolute value equations
- On unique solvability of the absolute value equation
- Absolute value equations
- A generalized Newton method for absolute value equations
- The relaxed nonlinear PHSS-like iteration method for absolute value equations
- Absolute value equation solution via dual complementarity
- Smoothing methods for nonlinear complementarity problems
- 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
- A theorem of the alternatives for the equationAx+B|x| =b
- A Smoothing Method for Sparse Optimization over Polyhedral Sets
