A new concave minimization algorithm for the absolute value equation solution

DOI10.1007/s11590-020-01691-zzbMath1475.90075OpenAlexW3119015524MaRDI QIDQ2047210

Milan Hladík, Moslem Zamani

Publication date: 19 August 2021

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

Full work available at URL: https://doi.org/10.1007/s11590-020-01691-z

zbMATH Keywords

linear complementarity problemabsolute value equationconcave minimization algorithms

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes, Two new iteration methods with optimal parameters for solving absolute value equations, Convergence results for some piecewise linear solvers, On finite termination of the generalized Newton method for solving 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, An inverse-free dynamical system for solving the absolute value equations

Uses Software

• CPLEX

Cites Work

• On the global convergence of the inexact semi-smooth Newton method for absolute value equation
• On solving linear complementarity problems by DC programming and DCA
• A hybrid algorithm for solving the absolute value equation
• Bounds for the solutions of absolute value equations
• 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
• Necessary and sufficient global optimality conditions for convex maximization revisited
• Solution of general linear complementarity problems via nondifferentiable concave minimization
• Sufficient conditions for the unsolvability and solvability of the absolute value equation
• The unique solution of the absolute value equations
• Absolute value equation solution via concave minimization
• Natural Operations on Differential Forms
• Solving the linear complementarity problem through concave programming
• Mean value theorems in nonsmooth analysis
• Linear complementarity problems solvable by A single linear program
• Characterization of linear complementarity problems as linear programs
• On solving linear complementarity problems as linear programs
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Convex Analysis
• A Fourth-Order Finite-Difference Approximation for the Fixed Membrane Eigenproblem
• Convex analysis and global optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item