en
Report
Open access
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
537views
708downloads

Technical informations

Creation04/15/2010 12:20:43 PM
First validation04/15/2010 12:20:43 PM
Update time03/14/2023 3:26:50 PM
Status update03/14/2023 3:26:50 PM
Last indexation01/15/2024 7:44:49 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack