Sufficient conditions for the unsolvability and solvability of the absolute value equation

DOI10.1007/s11590-017-1115-zzbMath1381.90058OpenAlexW2587260536MaRDI QIDQ1676495

Olvi L. Mangasarian

Publication date: 9 November 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-017-1115-z

zbMATH Keywords

solvabilitylinear inequalitiesabsolute value equationunsolvability

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05)

Related Items

Some notes on the solvability conditions for absolute value equations, Sufficient conditions for the solvability of a Sylvester-like absolute value matrix equation, A new concave minimization algorithm for the absolute value equation solution, A new two-step iterative method for solving absolute value equations, The Picard-HSS-SOR iteration method for absolute value equations, Absolute value equations with tensor product structure: unique solvability and numerical solution.

Uses Software

• Matlab
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Primal-dual bilinear programming solution of the absolute value equation
• Absolute value equations
• Absolute value programming
• A generalized Newton method for absolute value equations
• Knapsack feasibility as an absolute value equation solvable by successive linear programming
• NP-completeness of the linear complementarity problem
• Absolute value equation solution via concave minimization
• Complementary pivot theory of mathematical programming
• Linear complementarity problems solvable by A single linear program
• Unsupervised classification via convex absolute value inequalities