Minimum norm solution of the absolute value equations via simulated annealing algorithm
From MaRDI portal
Publication:897990
DOI10.1007/s13370-014-0281-8zbMath1327.90105MaRDI QIDQ897990
Publication date: 8 December 2015
Published in: Afrika Matematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13370-014-0281-8
quadratic programming; simulated annealing algorithm; minimum norm solution; absolute value equations
Related Items
The solution of the absolute value equations using two generalized accelerated overrelaxation methods, Absolute value equations with data uncertainty in the $l_1$ and $l_\infty$ norm balls, A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations, Optimal correction of the absolute value equations, A new two-step iterative method for solving absolute value equations, Two new fixed point iterative schemes for absolute value equations, The new iteration methods for solving absolute value equations.
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- 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
- A class of linear complementarity problems solvable in polynomial time
- An algorithm for computing all solutions of an absolute value equation
- On an iterative method for solving absolute value equations
- Absolute value equation solution via concave minimization
- Complementary pivot theory of mathematical programming
- Global Optimization Approach to the Linear Complementarity Problem
- Minimum norm solution to the positive semidefinite linear complementarity problem
