Optimization Online


Interior-Point Algorithms for a Generalization of Linear Programming and Weighted Centering

Kurt Anstreicher(kurt-anstreicher***at***uiowa.edu)

Abstract: We consider an extension of ordinary linear programming (LP) that adds weighted logarithmic barrier terms for some variables. The resulting problem generalizes both LP and the problem of finding the weighted analytic center of a polytope. We show that the problem has a dual of the same form and give complexity results for several different interior-point algorithms. We obtain an improved complexity result for certain cases by utilyzing a combination of the volumetric and logarithmic barriers. As an application we consider the complexity of solving the Eisenberg-Gale formulation of a Fisher equilibrium problem with linear utility functions.

Keywords: Linear programming, Weighted analytic center, Interior-point algorithms, Volumetric barrier

Category 1: Linear, Cone and Semidefinite Programming (Linear Programming )

Category 2: Convex and Nonsmooth Optimization (Convex Optimization )

Citation: Dept. of Management Sciences, University of Iowa, February 2011

Download: [PDF]

Entry Submitted: 02/23/2011
Entry Accepted: 02/23/2011
Entry Last Modified: 02/23/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society