A new concave minimization algorithm for the absolute value equation solution

DOI10.1007/S11590-020-01691-ZMaRDI QIDQ2047210zbMATH OpenOpenAlexFDO

Authors Moslem Zamani, Milan Hladík

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)

Recommendations

• Absolute value equation solution via concave minimization
• Minimum norm solution to the absolute value equation in the convex case
• scientific article; zbMATH DE number 764397
• A quadratically convergent descent method for the absolute value equation \(Ax + B |x| = b\)
• Two new iteration methods with optimal parameters for solving absolute value equations
• A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations
• An algebra-based approach for linearly constrained concave minimization
• A new conic method for unconstrained minimization
• The new iteration algorithm for absolute value equation
• Novel algorithms for solving a system of absolute value variational inequalities

Cites work

• scientific article; zbMATH DE number 46303 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1059222 (Why is no real title available?)
• scientific article; zbMATH DE number 757677 (Why is no real title available?)
• scientific article; zbMATH DE number 967074 (Why is no real title available?)
• A Fourth-Order Finite-Difference Approximation for the Fixed Membrane Eigenproblem
• A generalized Newton method for absolute value equations
• A hybrid algorithm for solving the absolute value equation
• Absolute value equation solution via concave minimization
• Absolute value equations
• Absolute value programming
• Bounds for the solutions of absolute value equations
• Characterization of linear complementarity problems as linear programs
• Convex Analysis
• Convex analysis and global optimization
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Forty necessary and sufficient conditions for regularity of interval matrices: A survey
• Global and finite convergence of a generalized Newton method for absolute value equations
• Linear complementarity problems solvable by A single linear program
• Mean value theorems in nonsmooth analysis
• Natural Operations on Differential Forms
• Necessary and sufficient global optimality conditions for convex maximization revisited
• On solving linear complementarity problems as linear programs
• On solving linear complementarity problems by DC programming and DCA
• On the global convergence of the inexact semi-smooth Newton method for absolute value equation
• Solution of general linear complementarity problems via nondifferentiable concave minimization
• Solving the linear complementarity problem through concave programming
• Sufficient conditions for the unsolvability and solvability of the absolute value equation
• The unique solution of the absolute value equations

Cited in

(14)

• The new iteration methods for solving absolute value equations.
• The proximal methods for solving absolute value equation
• An inverse-free dynamical system for solving the absolute value equations
• The solution of a type of absolute value equations using two new matrix splitting iterative techniques
• Error bounds and a condition number for the absolute value equations
• Absolute value equation solution via concave minimization
• Augmented Lagrangian method for finding minimum norm solution to the absolute value equation
• On finite termination of the generalized Newton method for solving absolute value equations
• Minimum norm solution to the absolute value equation in the convex case
• Two new iteration methods with optimal parameters for solving absolute value equations
• Convergence results for some piecewise linear solvers
• Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes
• An inertial inverse-free dynamical system for solving absolute value equations
• Further study on two fixed point iterative schemes for absolute value equations

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A new concave minimization algorithm for the absolute value equation solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2047210)