A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
type: Item
instance of: scholarly article
title: A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
zbMATH Open document ID: 1360.90291
author: Tamás Terlaky
author: Ali Mohammad Nezhad
published in: Computational Optimization and Applications
publication date: 2017-04-21T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6706972
zbMATH Keywords: interior-point method
zbMATH Keywords: Dikin-type affine scaling method
zbMATH Keywords: symmetric conic optimization
zbMATH Keywords: Euclidean Jordan algebra
describes a project that uses: Mosek
describes a project that uses: SeDuMi
describes a project that uses: Benchmarks for Optimization Software
describes a project that uses: SDPT3
MaRDI profile type: Publication
full work available at URL: s10589-016-9874-5
OpenAlex ID: W2514687199
cites work: Q4517103
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Q4321748
cites work: Euclidean Jordan algebras and interior-point algorithms
cites work: A Jordan-algebraic approach to potential-reduction algorithms
cites work: Q3996571
cites work: Interior Point Trajectories in Semidefinite Programming
cites work: Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
cites work: Barrier Functions in Interior Point Methods
cites work: A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
cites work: A new polynomial-time algorithm for linear programming
cites work: Polynomial primal-dual affine scaling algorithms in semidefinite programming
cites work: An independent benchmarking of SDP and SOCP solvers
cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
cites work: Q4324980
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: Q4791754
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: Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: Similarity and other spectral relations for symmetric cones
cites work: On the Identification of the Optimal Partition of Second Order Cone Optimization Problems
cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
cites work: Solving semidefinite-quadratic-linear programs using SDPT3
cites work: On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
DOI: 10.1007/S10589-016-9874-5
description: scientific article; zbMATH DE number 6706972