A primal–dual regularized interior-point method for semidefinite programming
type: Item
instance of: scholarly article
title: A primal–dual regularized interior-point method for semidefinite programming
zbMATH Open document ID: 1365.90189
DOI: 10.1080/10556788.2016.1235708
publication date: 2017-06-21T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49N15
zbMATH DE Number: 6734175
zbMATH Keywords: semidefinite programming
zbMATH Keywords: regularization
zbMATH Keywords: interior-point method
zbMATH Keywords: symmetric quasi-definite
zbMATH Keywords: degeneracy
zbMATH Keywords: Slater's condition
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1080/10556788.2016.1235708
OpenAlex ID: W2531901171
cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
cites work: On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
cites work: Handbook on semidefinite, conic and polynomial optimization
cites work: Benchmarking optimization software with performance profiles.
cites work: MA57---a code for the solution of sparse symmetric definite and indefinite systems
cites work: A primal-dual regularized interior-point method for convex quadratic programs
cites work: On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
cites work: Q5689624
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: An Interior-Point Method for Semidefinite Programming
cites work: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
cites work: Q5566063
cites work: On free variables in interior point methods
cites work: Primal--Dual Path-Following Algorithms for Semidefinite Programming
cites work: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
cites work: Solution of Sparse Indefinite Systems of Linear Equations
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: On the Nesterov--Todd Direction in Semidefinite Programming
cites work: A study of search directions in primal-dual interior-point methods for semidefinite programming
cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
cites work: Semidefinite Programming
cites work: Applications of semidefinite programming
cites work: Symmetric Quasidefinite Matrices
cites work: On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
published in: Optimization Methods \& Software
description: scientific article; zbMATH DE number 6734175