## Abstract

We present an infeasible Full-Newton-Step Interior-Point Method for Linear Complementarily Problems. The advantage of the method, in addition to starting from an infeasible stating point, is that it uses full Newton-steps, thus avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters iterates are forced to stay in the neighborhood of the central path, thus, still guaranteeing the global convergence of the method. The number of iterations necessary to find epsilon-approximate solution of the problem matches the best known iteration bounds for these types of methods.

Original language | American English |
---|---|

State | Published - Aug 19 2012 |

Event | International Symposium on Mathematical Programming (ISMP) - Berlin, Germany Duration: Aug 19 2012 → … |

### Conference

Conference | International Symposium on Mathematical Programming (ISMP) |
---|---|

Period | 08/19/12 → … |

## Keywords

- Infeasible full-Newton-step interior-point method
- Linear complementarity problems

## DC Disciplines

- Mathematics

## Fingerprint

Dive into the research topics of 'Infeasible Full Newton-Step Interior-Point Methods for*P**(κ)-Linear Complementarity Problems'. Together they form a unique fingerprint.