On equivalent reformulations for absolute value equations
From MaRDI portal
Publication:2655401
DOI10.1007/s10589-007-9158-1zbMath1181.90263OpenAlexW2053227127MaRDI QIDQ2655401
Publication date: 25 January 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9158-1
Mixed integer programming (90C11) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (75)
Unified smoothing functions for absolute value equation associated with second-order cone ⋮ Duality of nonconvex optimization with positively homogeneous functions ⋮ Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes ⋮ Further study on tensor absolute value equations ⋮ On the unique solution of a class of absolute value equations \(Ax-B|Cx| = d \) ⋮ A relaxed generalized Newton iteration method for generalized absolute value equations ⋮ On Picard-SHSS iteration method for absolute value equation ⋮ Merit functions for absolute value variational inequalities ⋮ On the global convergence of the inexact semi-smooth Newton method for absolute value equation ⋮ Two new iteration methods with optimal parameters for solving absolute value equations ⋮ A modified fixed point iteration method for solving the system of absolute value equations ⋮ Numerical solution of the absolute value equations using two matrix splitting fixed point iteration methods ⋮ An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side ⋮ The relaxed nonlinear PHSS-like iteration method for absolute value equations ⋮ Solving absolute value equation using complementarity and smoothing functions ⋮ Numerical validation for systems of absolute value equations ⋮ On developing a stable and quadratic convergent method for solving absolute value equation ⋮ Numerical comparisons of smoothing functions for optimal correction of an infeasible system of absolute value equations ⋮ A generalized Newton method for absolute value equations associated with second order cones ⋮ Modulus-based circulant and skew-circulant splitting iteration method for the linear complementarity problem with a Toeplitz matrix ⋮ On the solution of general absolute value equations ⋮ Absolute value equation solution via linear programming ⋮ Neurodynamic optimization approaches with finite/fixed-time convergence for absolute value equations ⋮ Semidefinite Relaxation Methods for Tensor Absolute Value Equations ⋮ Modified Newton-type iteration methods for generalized absolute value equations ⋮ Some notes on the solvability conditions for absolute value equations ⋮ Smoothing Levenberg-Marquardt algorithm for solving non-Lipschitz absolute value equations ⋮ Absolute value equations with uncertain data ⋮ On finite termination of the generalized Newton method for solving absolute value equations ⋮ Smoothing techniques in solving non-Lipschitz absolute value equations ⋮ The new iteration methods for solving absolute value equations. ⋮ A New Fixed-Time Dynamical System for Absolute Value Equations ⋮ A verification method for enclosing solutions of absolute value equations ⋮ An inertial inverse-free dynamical system for solving absolute value equations ⋮ Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation ⋮ Absolute value equation solution via dual complementarity ⋮ The solution of a type of absolute value equations using two new matrix splitting iterative techniques ⋮ TWO CSCS-BASED ITERATION METHODS FOR SOLVING ABSOLUTE VALUE EQUATIONS ⋮ An iterative method for solving absolute value equations and sufficient conditions for unique solvability ⋮ A note on absolute value equations ⋮ Sufficient conditions for the solvability of a Sylvester-like absolute value matrix equation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Interval algorithm for absolute value equations ⋮ The Picard-HSS iteration method for absolute value equations ⋮ Picard splitting method and Picard CG method for solving the absolute value equation ⋮ On matrix characterizations for \(P\)-property of the linear transformation in second-order cone linear complementarity problems ⋮ A modified SOR-like method for absolute value equations associated with second order cones ⋮ A generalized Newton method for absolute value equations associated with circular cones ⋮ A hybrid algorithm for solving the absolute value equation ⋮ Numerical comparisons based on four smoothing functions for absolute value equation ⋮ A dynamic model to solve the absolute value equations ⋮ Bounds for the solutions of absolute value equations ⋮ A branch-and-bound method for absolute value programs ⋮ A theorem of the alternatives for the equation \(|Ax|-|B||x|=b\) ⋮ An algorithm for computing all solutions of an absolute value equation ⋮ Primal-dual bilinear programming solution of the absolute value equation ⋮ A residual existence theorem for linear equations ⋮ Neural network based on systematically generated smoothing functions for absolute value equation ⋮ A smoothing Newton method for absolute value equation associated with second-order cone ⋮ New sufficient conditions for the unique solution of a square Sylvester-like absolute value equation ⋮ Optimal correction of the absolute value equations ⋮ On unique solvability of the absolute value equation ⋮ An inverse-free dynamical system for solving the absolute value equations ⋮ Equilibrium problems involving the Lorentz cone ⋮ Tikhonov regularization for infeasible absolute value equations ⋮ Modified HS conjugate gradient method for solving generalized absolute value equations ⋮ Levenberg-Marquardt method for absolute value equation associated with second-order cone ⋮ Unnamed Item ⋮ Checking solvability of systems of interval linear equations and inequalities via mixed integer programming ⋮ Sufficient conditions for the unique solution of a new class of Sylvester-like absolute value equations ⋮ Two new fixed point iterative schemes for absolute value equations ⋮ Method of alternating projections for the general absolute value equation ⋮ On the solvability and Picard-type method for absolute value matrix equations ⋮ The sparsest solution to the system of absolute value equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Absolute value equations
- Absolute value programming
- NP is as easy as detecting unique solutions
- Complexity of uniqueness and local search in quadratic 0-1 programming
- On complexity of unconstrained hyperbolic 0--1 programming problems
- Absolute value equation solution via concave minimization
- Global Optimization Approach to the Linear Complementarity Problem
- Linear complementarity problems solvable by integer programming
- A theorem of the alternatives for the equationAx+B|x| =b
This page was built for publication: On equivalent reformulations for absolute value equations
