An optimization problem on subsets of the symmetric positive-semidefinite matrices
From MaRDI portal
Recommendations
- Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
- Optimization Problems over Positive Pseudopolynomial Matrices
- Optimization over structured subsets of positive semidefinite matrices via column generation
- On generalizations of positive subdefinite matrices and the linear complementarity problem
- scientific article; zbMATH DE number 1748522
- Positive subdefinite matrices, generalized monotonicity, and linear complementarity problems
- On a class of symmetric optimization problems
- The almost positive subdefinite matrix
- On certain optimization problems related to matrix norms
- scientific article; zbMATH DE number 69501
Cites work
- A Nonlinear Programming Problem in Statistics (Educational Testing)
- Algebraic Perron-Frobenius theory
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Cones of diagonally dominant matrices
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- Large-Scale Optimization of Eigenvalues
- 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
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- On the cone of positive semidefinite matrices
- Semi-Definite Matrix Constraints in Optimization
- The embedding problem for predistance matrices
- The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems
Cited in
(3)
This page was built for publication: An optimization problem on subsets of the symmetric positive-semidefinite matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321430)