Skip to main content
Log in

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

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Motivated by the metricsstress problem in multidimensional scaling, the authors consider the more general problem of minimizing a strictly convex function on a particular subset ofR n × n. The subset in question is the intersection of a linear subspace with the symmetric positive-semidefinite matrices of rank ≤p. Because of the rank restriction, this subset is not convex. Several equivalent formulations of this problem are derived, and the advantages and disadvantages of each formulation are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Fletcher, R.,A Nonlinear Programming Problem in Statistics (Educational Testing), SIAM Journal on Scientific and Statistical Computing, Vol. 2, pp. 257–267, 1981.

    Google Scholar 

  2. Fletcher, R.,Semidefinite Matrix Constraints in Optimization, SIAM Journal on Control and Optimization, Vol. 23, pp. 493–513, 1985.

    Google Scholar 

  3. Alizadeh, F.,Optimization over the Positive-Semidefinite Cone: Interior Point Methods and Combinatorial Applications, Manuscript, Computer Science Department, University of Minnesota, 1991.

  4. Cullum, J., Donath, W. E., andWolf, P.,The Minimization of Certain Nondifferentiable Sums of Eigenvalue Problems, Mathematical Programming Studies, Vol. 3, pp. 35–55, 1975.

    Google Scholar 

  5. Friedland, S., Nocedal, J., andOverton, M.,The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems, SIAM Journal on Numerical Analysis, Vol. 24, pp. 634–667, 1987.

    Google Scholar 

  6. Overton, M.,On Minimizing the Maximum Eigenvalue of a Symmetric Matrix, SIAM Journal on Matrix Analysis and Applications, Vol. 9, pp. 256–268, 1988.

    Google Scholar 

  7. Overton, M.,Large-Scale Optimization of Eigenvalues, Report 505, Computer Science Department, New York University, 1990.

  8. De Leeuw, J., andHeiser, W.,Theory of Multidimensional Scaling, Handbook of Statistics, Edited by P. R. Krishnaiah, North-Holland, Amsterdam, Holland, Vol. 2, pp. 285–316, 1982.

    Google Scholar 

  9. Critchley, F.,On Certain Linear Mapping between Inner-Product and Squared-Distance Matrices, Linear Algebra and Its Applications, Vol. 105, pp. 91–107, 1988.

    Google Scholar 

  10. Stumpf, C.,Tonsychologie, Vols. 1 and 2, Teubner, Leipzig, Germany, 1880.

    Google Scholar 

  11. Takane, Y., Young, F. W., andDe Leeuw, J.,Nonmetric Individual Differences in Multidimensional Scaling: An Alternating Least-Squared Method with Optimal Scaling Features, Psychometrika, Vol. 42, pp. 7–67, 1977.

    Google Scholar 

  12. Obenchain, R.,Squared-Distance Scaling as an Alternative to Principal Components Analysis, Manuscript, Bell Laboratories, 1971.

  13. Hayashi, C.,Minimum Dimension Analysis, Behaviormetrika, Vol. 1, pp. 1–24, 1974.

    Google Scholar 

  14. Browne, M. W.,The Young-Householder Algorithm and the Least-Square Multidimensional Scaling of Squared Distances, Journal of Classification, Vol. 4, pp. 175–190, 1987.

    Google Scholar 

  15. Trosset, M. W.,A Constrained Optimization Approach to Nonmetric Multi-dimensional Scaling, American Statistical Association, 1990 Proceedings of the Statistical Computing Section, pp. 117–121, 1990.

  16. Glunt, W., Hayden, T. L., Hong, S., andWells, J.,An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix, SIAM Journal on Matrix Analysis and Applications, Vol. 11, pp. 589–600, 1990.

    Google Scholar 

  17. Glunt, W., Hayden, T. L., andLiu, W. M.,The Embedding Problem for Predistance Matrices, Bulletin of Mathematical Biology, Vol. 53, pp. 769–796, 1991.

    Google Scholar 

  18. Havel, T., andCrippen, G.,Distance Geometry and Molecular Conformation, John Wiley and Sons, New York, New York, 1988.

    Google Scholar 

  19. Barker, G. P., andCarlson, D.,Cones of Diagonally Dominant Matrices, Pacific Journal of Mathematics, Vol. 57, pp. 15–31, 1975.

    Google Scholar 

  20. Barker, G. P., andSchneider, H.,Algebraic Perron-Frobenius Theory, Linear Algebra and Its Applications, Vol. 11, pp. 219–233, 1975.

    Google Scholar 

  21. Hill, R. D., andWaters, S. R.,On the Cone of Positive Semidefinite Matrices, Linear Algebra and Its Applications, Vol. 90, pp. 81–88, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by R. A. Tapia

Part of this research was conducted while the authors were visitors at the Center for Research on Parallel Computation, Rice University, Houston, Texas. The first author was partially supported by National Science Foundation Grant RII-89-05080.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tarazaga, P., Trosset, M.W. An optimization problem on subsets of the symmetric positive-semidefinite matrices. J Optim Theory Appl 79, 513–524 (1993). https://doi.org/10.1007/BF00940556

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00940556

Key Words

Navigation