Characterization of the barrier parameter of homogeneous convex cones
From MaRDI portal
Publication:1290599
DOI10.1007/BF01584844zbMath0919.90124MaRDI QIDQ1290599
Publication date: 3 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
Monotonicity and circular cone monotonicity associated with circular cones, On the Computability of Continuous Maximum Entropy Distributions with Applications, A bound on the Carathéodory number, The \(p\)-cones in dimension \(n\geq 3\) are not homogeneous when \(p\neq 2\), Sensor network localization, Euclidean distance matrix completions, and graph realization, A cone constrained convex program: structure and algorithms, Linear optimization over homogeneous matrix cones, \(L^{p}\)-norms, log-barriers and Cramer transform in optimization, Performance enhancements for a generic conic interior point algorithm, Existence and uniqueness of solutions for homogeneous cone complementarity problems, A lower bound on the barrier parameter of barriers for convex cones, On convex optimization without convex representation, Why the logarithmic barrier function in convex and linear programming?, Tractable approximations to robust conic optimization problems, On cone of nonsymmetric positive semidefinite matrices, Spectrahedral cones generated by rank \(1\) matrices, Recursive construction of optimal self-concordant barriers for homogeneous cones, New stopping criteria for detecting infeasibility in conic optimization, Similarity and other spectral relations for symmetric cones, On the optimal parameter of a self-concordant barrier over a symmetric cone
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modular forms on half-spaces of quaternions
- The construction of homogeneous convex cones
- Homogeneous Siegel domains
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Strong Duality for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Domains of positivity
