$On polynomiality of the method of analytic centers for fractional problems$

On polynomiality of the method of analytic centers for fractional problems

0.00 Avg rating—0 Votes

Article ID:	iaor19972092
Country:	Netherlands
Volume:	73
Issue:	2
Start Page Number:	175
End Page Number:	198
Publication Date:	May 1996
Journal:	Mathematical Programming (Series A)
Authors:	Nemirovskii A.
Keywords:	programming: mathematical

Abstract:

The paper establishes polynomial time convergence of the method of analytic centers for the fractional programming problem t⇒min•x∈G, tB(x)-A(x)∈K, where Gℝℝⁿ is a closed and bounded convex domain, Kℝℝ^m is a closed convex cone and A(x):G⇒ℝⁿ, B(x):G⇒K are regular enough (say, affine) mappings.

Reviews

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