Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming
type: Item
instance of: scholarly article
title: Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming
zbMATH Open document ID: 1066.90077
author: Henry Wolkowicz
author: Levent Tunçel
published in: Linear Algebra and its Applications
publication date: 2005-06-01T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 49K40
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 15B48
Mathematics Subject Classification ID: 15A24
zbMATH DE Number: 2173015
zbMATH Keywords: Semidefinite programming
zbMATH Keywords: Linear matrix equations
zbMATH Keywords: Existence and uniqueness
zbMATH Keywords: Kronecker product
zbMATH Keywords: Symmetric Kronecker product
zbMATH Keywords: Linear transformations
MaRDI profile type: Publication
full work available at URL: j.laa.2004.12.010
OpenAlex ID: W1964424570
Wikidata QID: Q114851473
cites work: Q4327459
cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
cites work: Computer-Oriented Formulation of Transition-Rate Matrices via Kronecker Algebra
cites work: Existence and Uniqueness of Optimal Matrix Scalings
cites work: Kronecker products and matrix calculus in system theory
cites work: Correction to 'Kronecker Products and Matrix Calculus in System Theory'
cites work: Semialgebraic topology over a real closed field. II: Basic theory of semialgebraic spaces
cites work: Q5565773
cites work: An Interior-Point Method for Semidefinite Programming
cites work: Q4303969
cites work: Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
cites work: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
cites work: The Gauss-Newton direction in semidefinite programming
cites work: C-numerical ranges andC-numerical radii
cites work: Primal--Dual Path-Following Algorithms for Semidefinite Programming
cites work: Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
cites work: Q4517105
cites work: A note on the existence of the Alizadeh-Haeberly-Overton direction 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: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: Cones, graphs and optimal scalings of matrices
cites work: Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP
cites work: Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
cites work: A study of search directions in primal-dual interior-point methods for semidefinite programming
cites work: On the Nesterov--Todd Direction in Semidefinite Programming
cites work: Generalization of primal-dual interior-point methods to convex optimization problems in conic form
cites work: Matrix Calculus and Zero-One Matrices
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
cites work: On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
DOI: 10.1016/J.LAA.2004.12.010
description: scientific article; zbMATH DE number 2173015