Error bounds and a condition number for the absolute value equations
From MaRDI portal
Publication:2687040
DOI10.1007/s10107-021-01756-6OpenAlexW2997321886MaRDI QIDQ2687040
Publication date: 1 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.12904
linear complementarity problemcondition numbererror boundsconvergence rateinterval matrixabsolute value equation
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Linear equations (linear algebraic aspects) (15A06)
Related Items (4)
Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes ⋮ Generalized Perron Roots and Solvability of the Absolute Value Equation ⋮ On finite termination of the generalized Newton method for solving absolute value equations ⋮ A modified inverse-free dynamical system for absolute value equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the global convergence of the inexact semi-smooth Newton method for absolute value equation
- A hybrid algorithm for solving the absolute value equation
- Bounds for the solutions of absolute value equations
- Systems of linear interval equations
- A Gershgorin-type lower bound for the smallest singular value
- Absolute value equations
- Absolute value programming
- Bounds for norms of the matrix inverse and the smallest singular value
- Bounds for the infinity norm of the inverse for certain \(M\)- and \(H\)-matrices
- Condition numbers and error bounds in convex programming
- Error bounds: necessary and sufficient conditions
- A comparison of error bounds for linear complementarity problems of \(H\)-matrices
- A generalized Newton method for absolute value equations
- Global and finite convergence of a generalized Newton method for absolute value equations
- A lower bound for the smallest singular value of a matrix
- New improved error bounds for the linear complementarity problem
- Error bounds in mathematical programming
- Convergence rate analysis of iteractive algorithms for solving variational inequality problems
- New error bounds and their applications to convergence analysis of iterative algorithms
- Numerical validation for systems of absolute value equations
- The unique solution of the absolute value equations
- An infinity norm bound for the inverse of Dashnic-Zusmanovich type matrices with applications
- On Rump's characterization of \(P\)-matrices
- A verification method for enclosing solutions of absolute value equations
- A new concave minimization algorithm for the absolute value equation solution
- An overview of polynomially computable characteristics of special interval matrices
- Solving absolute value equation using complementarity and smoothing functions
- An iterative method for solving absolute value equations and sufficient conditions for unique solvability
- Absolute value equation solution via concave minimization
- Computation of error bounds for P-matrix linear complementarity problems
- Weak sharp minima revisited. II: Application to linear regularity and error bounds
- Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
- Weak Sharp Minima in Mathematical Programming
- Perturbation Bounds of P-Matrix Linear Complementarity Problems
- Some continuity properties of polyhedral multifunctions
- Mean value theorems in nonsmooth analysis
- Interval Methods for Systems of Equations
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Computing the norm ∥A∥∞,1 is NP-hard∗
- A theorem of the alternatives for the equationAx+B|x| =b
- Accuracy and Stability of Numerical Algorithms
- Iterative Solution of Nonlinear Equations in Several Variables
- Linear Optimization Problems with Inexact Data
- A Fourth-Order Finite-Difference Approximation for the Fixed Membrane Eigenproblem
- A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming
This page was built for publication: Error bounds and a condition number for the absolute value equations
