## Self-regular proximities and new search directions for linear and semidefinite optimization (2000)

Venue: | Mathematical Programming |

Citations: | 8 - 5 self |

### BibTeX

@TECHREPORT{Peng00self-regularproximities,

author = {Jiming Peng and Cornelis Roos and Tamás Terlaky},

title = {Self-regular proximities and new search directions for linear and semidefinite optimization},

institution = {Mathematical Programming},

year = {2000}

}

### OpenURL

### Abstract

In this paper, we first introduce the notion of self-regular functions. Various appealing properties of self-regular functions are explored and we also discuss the relation between selfregular functions and the well-known self-concordant functions. Then we use such functions to define self-regular proximity measure for path-following interior point methods for solving linear optimization (LO) problems. Any self-regular proximity measure naturally defines a primal-dual search direction. In this way a new class of primal-dual search directions for solving LO problems is obtained. Using the appealing properties of self-regular functions, we prove that these new large-update path-following methods for LO enjoy a polynomial, O n q+1 2q log n iteration bound, where q ≥ 1 is the so-called barrier degree of the self-regular ε proximity measure underlying the algorithm. When q increases, this � bound approaches the √n n best known complexity bound for interior point methods, namely O log. Our unified �√n ε n analysis provides also the O log best known iteration bound of small-update IPMs. ε At each iteration, we need only to solve one linear system. As a byproduct of our results, we remove some limitations of the algorithms presented in [24] and improve their complexity as well. An extension of these results to semidefinite optimization (SDO) is also discussed.