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

DOI10.15807/JORSJ.36.73zbMATH Open0792.90055OpenAlexW595863803MaRDI QIDQ4285701FDOQ4285701

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

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

zbMATH Keywords

global convergenceHildreth's algorithminterval constrained quadratic programming

Mathematics Subject Classification ID

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

Cited In (4)

• SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality
• Title not available (Why is that?)
• A parallel relaxation method for quadratic programming problems with interval constraints
• 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)