Computing Distances Between Convex Sets and Subsets of the Positive Semidefinite Matrices

@inproceedings{Trosset1997ComputingDB,
  title={Computing Distances Between Convex Sets and Subsets of the Positive Semidefinite Matrices},
  author={Michael W. Trosset},
  year={1997}
}
We describe an important class of semide nite programming problems that has received scant attention in the optimization community These problems are derived from considerations in distance geometry and multidimensional scaling and therefore arise in a variety of disciplines e g computational chemistry and psychometrics In most applications the feasible positive semide nite matrices are restricted in rank so that recent interior point methods for semide nite programming do not apply We… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 30 REFERENCES

The di erentiation of pseudo-inverses and nonlinear least squares problems whose variables separate

  • G. H. Golub, V. Pereyra
  • SIAM Journal on Numerical Analysis,
  • 1973
Highly Influential
4 Excerpts

Nonlinear Programming: A Uni ed Approach

  • W. I. Zangwill
  • Prentice-Hall, Englewood Cli s, NJ,
  • 1969
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…