A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
type: Item
instance of: scholarly article
title: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
zbMATH Open document ID: 1256.90036
published in: Journal of Optimization Theory and Applications
publication date: 2013-02-11T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 6135502
zbMATH Keywords: symmetric optimization
zbMATH Keywords: interior-point methods
zbMATH Keywords: Euclidean Jordan algebras
zbMATH Keywords: small-update method
author: Guoqiang Wang
author: Yanqin Bai
MaRDI profile type: Publication
full work available at URL: s10957-012-0013-x
OpenAlex ID: W1996300679
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones
cites work: A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
cites work: Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
cites work: On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
cites work: Primal--Dual Path-Following Algorithms for Semidefinite Programming
cites work: On homogeneous interrior-point algorithms for semidefinite programming
cites work: Conic convex programming and self-dual embedding
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications
cites work: Barrier Functions in Interior Point Methods
cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms
cites work: On a commutative class of search directions for linear programming over symmetric cones
cites work: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
cites work: Extension of primal-dual interior point algorithms to symmetric cones
cites work: Q3415802
cites work: A new primal-dual path-following method for convex quadratic programming
cites work: A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
cites work: A new primal-dual path-following interior-point algorithm for semidefinite optimization
cites work: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
cites work: Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
cites work: Function spaces and reproducing kernels on bounded symmetric domains
cites work: Similarity and other spectral relations for symmetric cones
cites work: A Jordan-algebraic approach to potential-reduction algorithms
DOI: 10.1007/S10957-012-0013-X
description: scientific article; zbMATH DE number 6135502