Primal Interior Point Method for Generalized Minimax Functions

Abstrakt

A new class of primal interior point methods for generalized minimax optimization is described. These methods use besides a standard logarithmic barrier function also barrier functions bounded from below which have more favourable properties for investigation of global convergence. It deals with descent direction methods, where an approxmation of the Hessian matrix is computed by gradient differences or quasi-Newton updates. Two-level optimization is used. A direction vector is computed by a Choleski decompostition of a sparse matrix. Numerical experiments concerning two basic applications, minimization of a point maximum and a sum of absolute values of smooth functions, are presented.

Kategorie a štítky

  • Konferenční příspěvek (mezinárodní konf.)