Report
OA Policy
English

Augmented self-concordant barriers and nonlinear optimization problems with finite complexity

Collection
  • Cahiers de recherche; 2000.18
Publication date2000
Abstract

In this paper we study special barrier functions for the convex cones, which are the sum of a self-concordant barrier for the cone and a positive-semidefinite quadratric form. We show that the central path of these augmented barrier functions can be traced with linear speed. We also study the complexity of finding the analytic center of the augmented barrier. This problem itself has some interesting applications. We show that for some special classes of quadratic forms and some convex cones, the computation of the analytic center requires an amount of operations independent on the particular data set. We argue that these problems form a class that is endoweed with a property which we call finite polynomial complexity.

Keywords
  • Augmented barrier
  • Self-concordant functions
  • Finite methods
  • Nonlinear optimization
Citation (ISO format)
NESTOROV, Yurii, VIAL, Jean-Philippe. Augmented self-concordant barriers and nonlinear optimization problems with finite complexity. 2000
Main files (1)
Report
accessLevelPublic
Identifiers
  • PID : unige:5851
620views
769downloads

Technical informations

Creation15/04/2010 12:20:43
First validation15/04/2010 12:20:43
Update time14/03/2023 15:26:50
Status update14/03/2023 15:26:50
Last indexation29/10/2024 14:24:33
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack