An optimization problem on subsets of the symmetric positive-semidefinite matrices

DOI10.1007/BF00940556zbMath0797.90077OpenAlexW2044571085MaRDI QIDQ1321430

Michael W. Trosset, Pablo Tarazaga

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940556

zbMATH Keywords

multidimensional scalingmatrix optimizationrank restrictionssemidefinite constraints

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (1)

Eigenvalue estimates for symmetric matrices

Cites Work

• Unnamed Item
• Nonmetric individual differences multidimensional scaling: An alternating least squares method with optimal scaling features
• On certain linear mappings between inner-product and squared-distance matrices
• The embedding problem for predistance matrices
• Algebraic Perron-Frobenius theory
• On the cone of positive semidefinite matrices
• Cones of diagonally dominant matrices
• An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
• Semi-Definite Matrix Constraints in Optimization
• The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems
• On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
• A Nonlinear Programming Problem in Statistics (Educational Testing)
• Large-Scale Optimization of Eigenvalues

This page was built for publication: An optimization problem on subsets of the symmetric positive-semidefinite matrices