A new infeasible interior-point algorithm for linear programming

Authors:
Miguel Argáez;Leticia Velázquez
Affiliations:
The University of Texas at El Paso, El Paso, TX;The University of Texas at El Paso, El Paso, TX
Venue:
Proceedings of the 2003 conference on Diversity in computing
Year:
2003

Citing 2
Cited 1

A primal-dual interior point algorithm for linear programming

Progress in Mathematical Programming Interior-point and related methods
On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming

Journal of Optimization Theory and Applications

An algorithm for training a large scale support vector machine for regression based on linear programming and decomposition methods

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an infeasible path-following interior-point algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as a central region. The algorithm starts from an infeasible point which satisfies that the norm of the dual condition is less than the norm of the primal condition. We use weighted sets as proximity measures of the quasicentral path, and a new merit function for making progress toward this central region. We test the algorithm on a set of NETLIB problems obtaining promising numerical results.