Primal-Dual Symmetric Scale-Invariant Square-Root Fields for Isotropic Self-Scaled Barrier Functionals
نویسنده
چکیده
Square-root elds are diierentiable operator elds used in the construction of target direction elds for self-scaled conic programming, a unifying framework for primal-dual interior-point methods for linear programming, semideenite programming and second-order cone programming. In this article we investigate square-root elds for so-called isotropic self-scaled barrier functionals, i.e. self-scaled barrier functionals that are invariant under rotations of their conic domain of deenition. We prove a structure theorem for so-called congruent square-root elds for isotropic self-scaled barrier functionals in terms of the irreducible decomposition of their domain of deenition. Using this structure theorem, we then investigate primal-dual symmetry and scale-invariance of such square-root elds. In our main theorem we show that these two assumptions together with one additional natural invariance property (so-called canonical reduction) dramatically reduce the degree of freedom in the choice of square-root elds that satisfy these properties, but that such square-root elds always exist.
منابع مشابه
Self-Scaled Barrier Functions: Decomposition and Classi cation
The theory of self-scaled conic programming provides a uniied framework for the theories of linear programming, semideenite programming and convex quadratic programming with convex quadratic constraints. Nesterov and Todd's concept of self-scaled barrier functionals allows the exploitation of algebraic and geometric properties of symmetric cones in certain variants of the barrier method applied...
متن کاملSelf-scaled Barriers for Semidefinite Programming
We show a result that can be expressed in any of the following three equivalent ways: 1. All self-scaled barrier functionals for the cone + of symmetric positive semideenite matrices are homothetic transformation of the universal barrier functional. 2. All self-scaled barrier functionals for + can be expressed in the form X 7 ! ?c 1 ln det X + c 0 for some constants c 1 > 0; c 0 2 R. 3. All sel...
متن کاملSELF { SCALED BARRIER FUNCTIONS ONSYMMETRIC CONES AND THEIR CLASSIFICATIONRaphael
Self{scaled barrier functions on self{scaled cones were introduced through a set of axioms in 1994 by Y. E. Nesterov and M. J. Todd as a tool for the construction of long{step interior point algorithms. This paper provides rm foundation for these objects by exhibiting their symmetry properties, their intimate ties with the symmetry groups of their domains of deenition, and subsequently their de...
متن کاملNumerical Analysis Reports SELF–SCALED BARRIER FUNCTIONS ON SYMMETRIC CONES AND THEIR CLASSIFICATION
Self–scaled barrier functions on self–scaled cones were introduced through a set of axioms in 1994 by Y. E. Nesterov and M. J. Todd as a tool for the construction of long–step interior point algorithms. This paper provides firm foundation for these objects by exhibiting their symmetry properties, their intimate ties with the symmetry groups of their domains of definition, and subsequently their...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999