Skip to main content

First-Order Algorithms for Optimization Problems with a Maximum Eigenvalue/Singular Value Cost and or Constraints

  • Chapter
Semi-Infinite Programming

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 57))

  • 943 Accesses

Abstract

Optimization problems with maximum eigenvalue or singular eigenvalue cost or constraints occur in the design of linear feedback systems, signal processing, and polynomial interpolation on a sphere. Since the maximum eigenvalue of a positive definite matrix Q(x) is given by max‖y‖=1〈(y, Q(x)y〉, we see that such problems are, in fact, semi-infinite optimization problems. We will show that the quadratic structure of these problems can be exploited in constructing specialized first-order algorithms for their solution that do not require the discretization of the unit sphere or the use of outer approximations techniques.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. P. Boyd, V. Balakrishnan, C. H. Barratt, N. M. Khraishi, X. Li, D. G. Meyer, and S. A. Norman. A new CAD method and associated architectures for linear controllers, IEEE Transactions on Automatic Control, 33:268–283, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  2. L. Davis, and E. Polak. Maximum likelihood constrained covariance estimation, Submitted to IEEE Transactions on Signal Processing, Sept 2000.

    Google Scholar 

  3. J. C. Doyle, and G. Stein. Multivariable feedback design concepts for a classical/modern synthesis, IEEE Transactions on Automatic Control, AC-26:4–16, 1981.

    Article  MATH  Google Scholar 

  4. M. Frank, and P. Wolfe. An algorithm for quadratic programming, Naval Research Logistics Quarterly, 3:95–110, 1956.

    Article  MathSciNet  Google Scholar 

  5. D. Gray, B. Anderson, and P. Sim. Estimation of structured covariances with applications to array beamforming, Circuits, Systems and Signal Processing, 6:421–447, 1987.

    Article  MATH  Google Scholar 

  6. J. E. Higgins, and E. Polak. Minimizing pseudo-convex functions on convex compact sets, Journal of Optimi Zation Theory andApplications, 65:128, 1990.

    MathSciNet  Google Scholar 

  7. A. S. Lewis, and M. L. Overton. Eigenvalue optimization, Acta Nurnerica, 5:149–190, 1996.

    Article  MathSciNet  Google Scholar 

  8. M. I. Miller, D. R. Fuhrmann, J. A. O’Sullivan, and D. L. Snyder. Maximum likelihood methods for Toeplitz covariance estimation and radar imaging. In S. Haykin, editor, Advances in Spectrum Analysis and Array Processing, Prentice-Hall, 1991.

    Google Scholar 

  9. V. Pisarenko. The retrieval of harmonics from a covariance function, Geophysical Journal of the Royal Astronomical Society, 33:347–366, 1973.

    Article  MATH  Google Scholar 

  10. E. Polak, and L. He. A unified steerable phase I — phase II method of feasible directions for semi-infinite optimization, Journal of Optimization Theory and Applications, 61: 83–107, 1991.

    Article  MathSciNet  Google Scholar 

  11. E. Polak. Optimization: Algorithms and Consistent Approximmations, Springer-Verlag, 1997.

    Google Scholar 

  12. I. H. Sloan. Interpolation and hyperinterpolation on the sphere, in Multivariate Approximation: Recent Trends and Results. In W. Hausmann, K. Jetter, and M. Reimer, editors, pages 255–268, Academie Verlag (WileyVCH), 1995.

    Google Scholar 

  13. D. Snyder, J. O’Sullivan, and M. Miller. The use of maximum likelihood estimation for forming images of diffuse radar targets from delay—Doppler data, IEEE Transactions on Information Theory, 35:536–548, 1989.

    Article  MathSciNet  Google Scholar 

  14. L. Vandenberghe, and S. Boyd. Semi-definite programming, SIAM Review, 38:49–95, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  15. R. S. Womersley, and I. H. Sloan. How good can polynomial interpolation on the sphere be?, Technical Report, School of Mathematics, University of New South Wales, , Sydney Australia, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Polak, E. (2001). First-Order Algorithms for Optimization Problems with a Maximum Eigenvalue/Singular Value Cost and or Constraints. In: Goberna, M.Á., López, M.A. (eds) Semi-Infinite Programming. Nonconvex Optimization and Its Applications, vol 57. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3403-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3403-4_9

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5204-2

  • Online ISBN: 978-1-4757-3403-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics