Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming

DOI10.1016/j.laa.2004.12.010zbMath1066.90077OpenAlexW1964424570WikidataQ114851473 ScholiaQ114851473MaRDI QIDQ1779251

Henry Wolkowicz, Tunçel, Levent

Publication date: 1 June 2005

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2004.12.010

zbMATH Keywords

Kronecker productSemidefinite programmingExistence and uniquenessLinear matrix equationsLinear transformationsSymmetric Kronecker product

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Sensitivity, stability, well-posedness (49K40) Matrix equations and identities (15A24) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (3)

Stability, performance and sensitivity analysis of I.I.D. jump linear systems ⋮ On the spectral structure of Jordan-Kronecker products of symmetric and skew-symmetric matrices ⋮ Invariance and efficiency of convex representations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semialgebraic topology over a real closed field. II: Basic theory of semialgebraic spaces
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
• Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
• A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• The Gauss-Newton direction in semidefinite programming
• Cones, graphs and optimal scalings of matrices
• Computer-Oriented Formulation of Transition-Rate Matrices via Kronecker Algebra
• Kronecker products and matrix calculus in system theory
• Correction to 'Kronecker Products and Matrix Calculus in System Theory'
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• On the Nesterov--Todd Direction in Semidefinite Programming
• Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
• C-numerical ranges andC-numerical radii
• Existence and Uniqueness of Optimal Matrix Scalings
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP
• A study of search directions in primal-dual interior-point methods for semidefinite programming
• Matrix Calculus and Zero-One Matrices
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• An Interior-Point Method for Semidefinite Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Generalization of primal-dual interior-point methods to convex optimization problems in conic form

This page was built for publication: Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming