# A Full-Newton Step Infeasible Interior-Point Algorithm for Linear Programming Based on a Kernel Function

A Full-Newton Step Infeasible Interior-Point Algorithm for Linear Programming Based on a Kernel... This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming, which is an extension of the work of Roos (SIAM J. Optim. 16(4):1110–1136, 2006 ). The main iteration of the algorithm consists of a feasibility step and several centrality steps. We introduce a kernel function in the algorithm to induce the feasibility step. For parameter p ∈(0,1), the polynomial complexity can be proved and the result coincides with the best result for infeasible interior-point methods, that is, O ( n log n / ε ). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Mathematics and Optimization Springer Journals

# A Full-Newton Step Infeasible Interior-Point Algorithm for Linear Programming Based on a Kernel Function

, Volume 60 (2) – Oct 1, 2009
15 pages

/lp/springer_journal/a-full-newton-step-infeasible-interior-point-algorithm-for-linear-y9aKzF3ovo
Publisher
Springer-Verlag
Subject
Mathematics; Numerical and Computational Methods ; Mathematical Methods in Physics; Mathematical and Computational Physics; Systems Theory, Control; Calculus of Variations and Optimal Control; Optimization
ISSN
0095-4616
eISSN
1432-0606
D.O.I.
10.1007/s00245-009-9069-x
Publisher site
See Article on Publisher Site

### Abstract

This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming, which is an extension of the work of Roos (SIAM J. Optim. 16(4):1110–1136, 2006 ). The main iteration of the algorithm consists of a feasibility step and several centrality steps. We introduce a kernel function in the algorithm to induce the feasibility step. For parameter p ∈(0,1), the polynomial complexity can be proved and the result coincides with the best result for infeasible interior-point methods, that is, O ( n log n / ε ).

### Journal

Applied Mathematics and OptimizationSpringer Journals

Published: Oct 1, 2009

### References

• An infeasible interior-point algorithm with full-Newton step for linear optimization
Liu, Z.; Sun, W.

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just \$49/month

### Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

### Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

### Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

### Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

DeepDyve

DeepDyve

### Pro

Price

FREE

\$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations