Self-Scaled Barriers and Interior-Point Methods for Convex Programming
نویسندگان
چکیده
منابع مشابه
Primal-Dual Interior-Point Methods for Self-Scaled Cones
In this paper we continue the development of a theoretical foundation for efficient primal-dual interior-point algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are self-scaled (see [NT97]). The class of problems under consideration includes linear programming, semidefinite programming and convex quadratically constrained quadratic prog...
متن کاملHyperbolic Polynomials and Interior Point Methods for Convex Programming
Hyperbolic polynomials have their origins in partial diierential equations. We show in this paper that they have applications in interior point methods for convex programming. Each homogeneous hyperbolic polynomial p has an associated open and convex cone called its hyperbolicity cone. We give an explicit representation of this cone in terms of polynomial inequalities. The function F (x) = ? lo...
متن کاملTarget Directions for Primal-dual Interior-point Methods for Self-scaled Conic Programming
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. In the linear programming literature there exists a unifying framework for the analysis of various important classes of interior-point algorithms, known under the name of target-following algor...
متن کامل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...
متن کاملNew complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
*Correspondence: [email protected] Department of Applied Mathematics, Pukyong National University, Busan, 608-737, Korea Abstract A linear optimization problem over a symmetric cone, defined in a Euclidean Jordan algebra and called a self-scaled optimization problem (SOP), is considered. We formulate an algorithm for a large-update primal-dual interior-point method (IPM) for the SOP by using a p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1997
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.22.1.1