Finding positive matrices subject to linear restrictions

DOI10.1016/j.laa.2007.06.002zbMath1125.15017OpenAlexW1999830149MaRDI QIDQ996327

Călin-Grigore Ambrozie

Publication date: 14 September 2007

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

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

zbMATH Keywords

optimizationinverse problemeigenvaluestraceconjugate gradient methodpositive definite completions

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (1)

Multivariate truncated moments problems and maximum entropy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Positive definite completions of partial Hermitian matrices
• Extensions of band matrices with band inverses
• Method of centers for minimizing generalized eigenvalues
• Optimization. Algorithms and consistent approximations
• Practical mathematical optimization. An introduction to basic optimization theory and classical and new gradient-based algorithms.
• Linearly constrained positive definite completions
• Linear Matrix Inequalities in System and Control Theory
• Maximum Entropy Elements in the Intersection of an Affine Space and the Cone of Positive Definite Matrices
• Semidefinite Programming
• Matrix inequalities

This page was built for publication: Finding positive matrices subject to linear restrictions