Minimum norm solution of the absolute value equations via simulated annealing algorithm

DOI10.1007/S13370-014-0281-8MaRDI QIDQ897990zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

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

zbMATH Keywords

quadratic programmingminimum norm solutionabsolute value equationssimulated annealing algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• Minimum norm solution to the absolute value equation in the convex case
• Absolute value equation solution via concave minimization
• Augmented Lagrangian method for finding minimum norm solution to the absolute value equation
• Absolute value equation solution via linear programming
• Some techniques for solving absolute value equations

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• A class of linear complementarity problems solvable in polynomial time
• A generalized Newton method for absolute value equations
• Absolute value equation solution via concave minimization
• Absolute value equations
• Absolute value programming
• An algorithm for computing all solutions of an absolute value equation
• Complementary pivot theory of mathematical programming
• Global Optimization Approach to the Linear Complementarity Problem
• Global and finite convergence of a generalized Newton method for absolute value equations
• Minimum norm solution to the positive semidefinite linear complementarity problem
• On an iterative method for solving absolute value equations
• Optimization by simulated annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited in

(9)

• Optimal correction of the absolute value equations
• Minimum norm solution to the absolute value equation in the convex case
• The new iteration methods for solving absolute value equations.
• A new two-step iterative method for solving absolute value equations
• Augmented Lagrangian method for finding minimum norm solution to the absolute value equation
• 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
• Two new fixed point iterative schemes for absolute value equations
• A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations

This page was built for publication: Minimum norm solution of the absolute value equations via simulated annealing algorithm

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