An algorithm for computing all solutions of an absolute value equation
From MaRDI portal
Publication:1758024
DOI10.1007/S11590-011-0305-3zbMATH Open1254.90260OpenAlexW1968411180MaRDI QIDQ1758024FDOQ1758024
Publication date: 7 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: http://www.nusl.cz/ntk/nusl-41908
Cites Work
- Absolute value equation solution via concave minimization
- Linear Optimization Problems with Inexact Data
- Systems of linear interval equations
- Absolute value equations
- Absolute value programming
- A generalized Newton method for absolute value equations
- On equivalent reformulations for absolute value equations
- Linear complementarity problems solvable by integer programming
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (24)
- Bounds for the solutions of absolute value equations
- Absolute value equation solution via linear programming
- A generalization of the Gauss-Seidel iteration method for solving absolute value equations
- A new two-step iterative method for solving absolute value equations
- Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation
- Generalized AOR method for solving absolute complementarity problems
- Absolute value equations with uncertain data
- Numerical validation for systems of absolute value equations
- Algorithmic solution of Abel's equation
- A hybrid algorithm for solving the absolute value equation
- A relaxed two-step splitting iteration method for computing PageRank
- Computer assisted solution of an equality problem of mean values
- Inexact Newton-type method for solving large-scale absolute value equation \(Ax-|x|=b\).
- A modified fixed point iteration method for solving the system of absolute value equations
- Title not available (Why is that?)
- Modified HS conjugate gradient method for solving generalized absolute value equations
- The Picard-HSS-SOR iteration method for absolute value equations
- Picard splitting method and Picard CG method for solving the absolute value equation
- A quadratically convergent descent method for the absolute value equation \(Ax + B |x| = b\)
- On an iterative method for solving absolute value equations
- Levenberg-Marquardt method for solving systems of absolute value equations
- Title not available (Why is that?)
- Minimum norm solution of the absolute value equations via simulated annealing algorithm
- Title not available (Why is that?)
This page was built for publication: An algorithm for computing all solutions of an absolute value equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1758024)