A T-Algebraic Approach to Primal-Dual Interior-Point Algorithms

DOI10.1137/060677343zbMath1198.90393OpenAlexW2099503041MaRDI QIDQ5189570

Chek Beng Chua

Publication date: 17 March 2010

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060677343

zbMATH Keywords

\(T\)-algebraprimal-dual interior-point algorithmhomogeneous cone programming

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Related Items (9)

An algorithm for nonsymmetric conic optimization inspired by MOSEK ⋮ The \(p\)-cones in dimension \(n\geq 3\) are not homogeneous when \(p\neq 2\) ⋮ Linear optimization over homogeneous matrix cones ⋮ Existence and uniqueness of solutions for homogeneous cone complementarity problems ⋮ Differential properties of Euclidean projection onto power cone ⋮ The decompositions with respect to two core non-symmetric cones ⋮ Unnamed Item ⋮ A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets ⋮ Characterizations of Boundary Conditions on Some Non-Symmetric Cones

This page was built for publication: A T-Algebraic Approach to Primal-Dual Interior-Point Algorithms