Knapsack feasibility as an absolute value equation solvable by successive linear programming

2008 ◽  
Vol 3 (2) ◽  
pp. 161-170 ◽  
Author(s):  
O. L. Mangasarian
1982 ◽  
Vol 28 (10) ◽  
pp. 1106-1120 ◽  
Author(s):  
F. Palacios-Gomez ◽  
L. Lasdon ◽  
M. Engquist

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Lin Zheng

AbstractIn this paper, we present the Picard-HSS-SOR iteration method for finding the solution of the absolute value equation (AVE), which is more efficient than the Picard-HSS iteration method for AVE. The convergence results of the Picard-HSS-SOR iteration method are proved under certain assumptions imposed on the involved parameter. Numerical experiments demonstrate that the Picard-HSS-SOR iteration method for solving absolute value equations is feasible and effective.


1970 ◽  
Vol 16 (5) ◽  
pp. 408-408 ◽  
Author(s):  
David F. Shanno ◽  
Roman L. Well

Sign in / Sign up

Export Citation Format

Share Document