Unified complexity analysis for Newton LP methods

Unified complexity analysis for Newton LP methods

0.00 Avg rating0 Votes
Article ID: iaor1993341
Country: Netherlands
Volume: 53
Issue: 1
Start Page Number: 1
End Page Number: 16
Publication Date: Jan 1992
Journal: Mathematical Programming (Series A)
Authors: ,
Keywords: programming: quadratic
Abstract:

The authors show that a theorem of Smale can be used to unify the polynomial-time bound proofs of several of the recent interior algorithms for linear programming and convex quadratic programming.

Reviews

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