A new concave minimization algorithm for the absolute value equation solution
type: Item
instance of: scholarly article
title: A new concave minimization algorithm for the absolute value equation solution
zbMATH Open document ID: 1475.90075
author: Moslem Zamani
author: Milan Hladík
published in: Optimization Letters
publication date: 2021-08-19T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 7383574
zbMATH Keywords: absolute value equation
zbMATH Keywords: concave minimization algorithms
zbMATH Keywords: linear complementarity problem
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s11590-020-01691-z
OpenAlex ID: W3119015524
cites work: Q3996569
cites work: On solving linear complementarity problems as linear programs
cites work: On the global convergence of the inexact semi-smooth Newton method for absolute value equation
cites work: Necessary and sufficient global optimality conditions for convex maximization revisited
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Q4833806
cites work: Q4353536
cites work: Mean value theorems in nonsmooth analysis
cites work: Q5690240
cites work: Bounds for the solutions of absolute value equations
cites work: A Fourth-Order Finite-Difference Approximation for the Fixed Membrane Eigenproblem
cites work: On solving linear complementarity problems by DC programming and DCA
cites work: Absolute value programming
cites work: A generalized Newton method for absolute value equations
cites work: Absolute value equations
cites work: Linear complementarity problems solvable by A single linear program
cites work: Characterization of linear complementarity problems as linear programs
cites work: Solution of general linear complementarity problems via nondifferentiable concave minimization
cites work: Absolute value equation solution via concave minimization
cites work: A hybrid algorithm for solving the absolute value equation
cites work: Sufficient conditions for the unsolvability and solvability of the absolute value equation
cites work: Solving the linear complementarity problem through concave programming
cites work: Natural Operations on Differential Forms
cites work: Convex Analysis
cites work: Q3559054
cites work: Q4221106
cites work: Convex analysis and global optimization
cites work: The unique solution of the absolute value equations
cites work: Global and finite convergence of a generalized Newton method for absolute value equations
DOI: 10.1007/S11590-020-01691-Z
Recommended article: Absolute value equation solution via concave minimization
Recommended article: Minimum norm solution to the absolute value equation in the convex case
Recommended article: Q4836283
Recommended article: A quadratically convergent descent method for the absolute value equation \(Ax + B |x| = b\)
Recommended article: Two new iteration methods with optimal parameters for solving absolute value equations
Recommended article: A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations
Recommended article: An algebra-based approach for linearly constrained concave minimization
Recommended article: A new conic method for unconstrained minimization
Recommended article: The new iteration algorithm for absolute value equation
Recommended article: Novel algorithms for solving a system of absolute value variational inequalities
description: scientific article; zbMATH DE number 7383574