Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems

نویسنده

  • Takashi Tsuchiya
چکیده

In this paper we investigate the global convergence property of the affine scaling method under the assumption of dual nondegeneracy. The behavior of the method near degenerate vertices is analyzed in detail on the basis of the equivalence between the affine scaling methods for homogeneous LP problems and Karmarkar's method. It is shown that the step-size 1/8, where the displacement vector is normalized with respect to the distance in the scaled space, is sufficient to guarantee the global convergence for dual nondegenerate LP problems. The result can be regarded as a counterpart to Dikin's global convergence result on the affine scaling method assuming primal nondegeneracy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global convergence of the affine scaling methods for degenerate linear programming problems

In this paper we show the global convergence of the anne scaling methods without assuming any condition on degeneracy. The behavior of the method near degenerate faces is analyzed in detail on the basis of the equivalence between the affine scaling methods for homogeneous LP problems and Karmarkar's method. It is shown that the step-size ~-, where the displacement vector is normalized with resp...

متن کامل

Computing the Projection in an Interior

Global convergence of the long-step aane scaling algorithm for degenerate linear programming problems, 9 tion time can be achieved by using a preconditioned conjugate gradient linear system solver. Convergence of the large step primal aane-scaling algorithm for primal non-degenerate linear programs,

متن کامل

A simplified global convergence proof of the affine scaling algorithm*

This paper presents a simplified and self-contained global convergence proof for the affine scaling algorithm applied to degenerate linear programming problems. Convergence of the sequence of dual estimates to the center of the optimal diial face is also proven. In addition, we give a sharp rate of convergence result for the sequence of objective function values. All these results are proved wi...

متن کامل

Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems

In this paper we present new global convergence results on a long-step affine scaling algorithm obtained by means of the local Karmarkar potential functions. This development was triggered by Dikin’s interesting result on the convergence of the dual estimates associated with a longstep affine scaling algorithm for homogeneous LP problems with unique optimal solutions. Without requiring any assu...

متن کامل

A constraint-reduced variant of Mehrotra's predictor-corrector algorithm

Consider linear programs in dual standard form with n constraints and m variables. When typical interior-point algorithms are used for the solution of such problems, updating the iterates, using direct methods for solving the linear systems and assuming a dense constraint matrix A, requires O(nm) operations per iteration. When n ≫ m it is often the case that at each iteration most of the constr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 17  شماره 

صفحات  -

تاریخ انتشار 1992