Direct ellipsoid method for convex quadratic program

Direct ellipsoid method for convex quadratic program

0.00 Avg rating0 Votes
Article ID: iaor20001184
Country: China
Volume: 16
Issue: 1
Start Page Number: 1
End Page Number: 10
Publication Date: Jan 1996
Journal: Journal of Systems Science and Complexity
Authors: ,
Abstract:

This paper shows how to apply the ellipsoid method directly to the convex quadratic programming and proves that the direct ellipsoid method can be terminated at an approximate optimal point in at most O(n2L) iterations with a total of O(n4L) arithmetic operations.

Reviews

Required fields are marked *. Your email address will not be published.