A SUCCESSIVE OVER-RELAXATION METHOD FOR QUADRATIC PROGRAMMING PROBLEMS WITH INTERVAL CONSTRAINTS
From MaRDI portal
Publication:4285701
DOI10.15807/jorsj.36.73zbMath0792.90055OpenAlexW595863803MaRDI QIDQ4285701
Toshihide Ibaraki, Masao Fukushima, Yoshikazu Shimazu
Publication date: 26 April 1994
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.36.73
Convex programming (90C25) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A parallel relaxation method for quadratic programming problems with interval constraints, SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality
