Curvature integrals and iteration complexities in SDP and symmetric cone programs
type: Item
instance of: scholarly article
title: Curvature integrals and iteration complexities in SDP and symmetric cone programs
zbMATH Open document ID: 1319.90049
author: Atsumi Ohara
author: Satoshi Kakihara
author: Takashi Tsuchiya
published in: Computational Optimization and Applications
publication date: 2014-09-04T00:00:00Z
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6339728
zbMATH Keywords: interior-point methods
zbMATH Keywords: primal-dual algorithms
zbMATH Keywords: path-following methods
zbMATH Keywords: iteration complexities
zbMATH Keywords: curvature
zbMATH Keywords: semidefinite programming
zbMATH Keywords: symmetric cone programs
describes a project that uses: SDPLIB
describes a project that uses: Netlib
MaRDI profile type: Publication
full work available at URL: s10589-013-9608-x
OpenAlex ID: W2161288103
cites work: Q4527387
cites work: SDPLIB 1.2, a library of semidefinite programming test problems
cites work: Q4348513
cites work: Q4321748
cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms
cites work: Information Geometry and Interior-Point Algorithms
cites work: Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
cites work: Q5202838
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming
cites work: A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
cites work: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
cites work: On a commutative class of search directions for linear programming over symmetric cones
cites work: Extension of primal-dual interior point algorithms to symmetric cones
cites work: On the complexity of following the central path of linear programs by linear extrapolation. II
cites work: On the Nesterov--Todd Direction in Semidefinite Programming
cites work: Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
DOI: 10.1007/S10589-013-9608-X
description: scientific article; zbMATH DE number 6339728