## Abstract

In this paper, the Iri-Imai algorithm for solving linear and convex quadratic programming is extended to solve some other smooth convex programming problems. The globally linear convergence rate of this extended algorithm is proved, under the condition that the objective and constraint functions satisfy a certain type of convexity, called the harmonic convexity in this paper. A characterization of this convexity condition is given. The same convexity condition was used by Mehrotra and Sun to prove the convergence of a path-following algorithm. The Iri-Imai algorithm is a natural generalization of the original Newton algorithm to constrained convex programming. Other known convergent interior-point algorithms for smooth convex programming are mainly based on the path-following approach.

Original language | English (US) |
---|---|

Pages (from-to) | 121-138 |

Number of pages | 18 |

Journal | Journal of Optimization Theory and Applications |

Volume | 82 |

Issue number | 1 |

DOIs | |

State | Published - Jul 1994 |

## Keywords

- Convex programming
- Iri-Imai algorithm
- convergence
- interior-point methods