A SUCCESSIVE OVER-RELAXATION METHOD FOR QUADRATIC PROGRAMMING PROBLEMS WITH INTERVAL CONSTRAINTS

DOI10.15807/JORSJ.36.73MaRDI QIDQ4285701zbMATH OpenOpenAlexFDO

Authors Yoshikazu Shimazu, Masao Fukushima, Toshihide Ibaraki

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

zbMATH Keywords

global convergenceHildreth's algorithminterval constrained quadratic programming

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Quadratic programming (90C20) Convex programming (90C25)

Recommendations

• On the convergence properties of Hildreth's quadratic programming algorithm
• A parallel relaxation method for quadratic programming problems with interval constraints
• scientific article; zbMATH DE number 4110462
• scientific article; zbMATH DE number 3890636
• An algorithm for solving quadratic programming problems

Cited in

(4)

• A parallel relaxation method for quadratic programming problems with interval constraints
• scientific article; zbMATH DE number 3890636 (Why is no real title available?)
• SOR- and Jacobi-type iterative methods for solving _1 - _2 problems by way of Fenchel duality
• On the convergence properties of Hildreth's quadratic programming algorithm

This page was built for publication: A SUCCESSIVE OVER-RELAXATION METHOD FOR QUADRATIC PROGRAMMING PROBLEMS WITH INTERVAL CONSTRAINTS

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