Skip to main content

Towards Second-Order Methods for Structured Nonsmooth Optimization

  • Chapter
Book cover Advances in Optimization and Numerical Analysis

Part of the book series: Mathematics and Its Applications ((MAIA,volume 275))

Abstract

Structured nonsmooth optimization objectives often arise in a composite form f = hoa, where h is convex (but not necessarily polyhedral) and a is smooth. We consider the case where the structure of the nonsmooth convex function h is known. Specifically, we assume that, for any given point in the domain of h, a parameterization of a manifold Ω, on which h reduces locally to a smooth function, is given. We discuss two linear spaces: the tangent space to the manifold Ω at a point, and the subspace parallel to the affine hull of the subdifferential of h at the same point, and explain that these are typically orthogonal complements. We indicate how the construction of locally second-order methods is possible, even when h is nonpolyhedral, provided the appropriate Lagrangian, modeling the structure, is used. We illustrate our ideas with two important convex functions: the ordinary max function, and the max eigenvalue function for symmetric matrices, and we solicit other interesting examples with genuinely different structure from the community.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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. V.I. Arnold. On matrices depending on parameters. Russian Mathematical Surveys, 26: 29–43, 1971.

    Article  Google Scholar 

  2. J.V. Burke. Descent methods for composite nondifferentiable optimization problems. Mathematical Programming, 33: 260–279, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  3. J.V. Burke. Second order necessary and sufficient conditions for convex composite NDO. Mathematical Programming, 38: 287–302, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  4. J.V. Burke and R. A. Poliquin. Optimality conditions for non-finite valued convex composite functions, 1992.

    Google Scholar 

  5. R.W. Chaney. On second derivatives for nonsmooth functions. Nonlinear Analysis: Theory, Methods and Applications, 9: 1189–1209, 1985.

    MathSciNet  MATH  Google Scholar 

  6. F. H. Clarke. Optimization and Nonsniooth Analysis. John Wiley, New York, 1983.

    Google Scholar 

  7. T.F. Fairgrieve. The application of singularity theory to the computation of the Jordan canonical form. Master’s thesis, University of Toronto, 1986.

    Google Scholar 

  8. R. Fletcher. Practical Methods of Optimization. John Wiley, Chichester and New York, second edition, 1987.

    MATH  Google Scholar 

  9. J.B. Hirriart-Urruty. A new set-valued second order derivative for convex functions. In J.B. Hirriart-Urruty, editor, Fermat Days 85: Mathematics for Optimization, pages 157–182, Amsterdam, 1986. North-Holland.

    Chapter  Google Scholar 

  10. A.D. Ioffe. On some recent developments in the theory of second order optimality conditions. In S.Dolecki, editor, Optimization, Lecture Notes in Math. 1405, pages 55–68. Springer-Verlag, 1989.

    Google Scholar 

  11. M.R. Osborne. Finite Algorithms in Optimization and Data Analysis. John Wiley, Chichester and New York, 1985.

    MATH  Google Scholar 

  12. M.L. Overton. Large-scale optimization of eigenvalues. SIAM Journal on Optimization, 2: 88–120, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  13. M.L. Overton and R.S. Sezginer. The largest singular value of ex Ao e-X is convex on convex sets of commuting matrices. IEEE Transactions on Automatic Control, 35: 229–230, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  14. M.L. Overton and R.S. Womersley. Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. Mathematical Programming, 1993. To appear.

    Google Scholar 

  15. M.L. Overton and R.S. Womersley. Second derivatives for optimizing eigenvalues of symmetric matrices. Computer Science Dept. Report 626, Courant Institute of Mathematical Sciences, NYU, 1993. Submitted to SIAM J. Matrix Anal. Appl.

    Google Scholar 

  16. R. Poliquin and R.T. R.ockafellar. A calculus of epi-derivatives applicable to optimization. Canadian Journal of Mathematics To appear.

    Google Scholar 

  17. R.T. Rockafellar. Convex Analysis. Princeton University Press, Princeton, N.J., 1970.

    MATH  Google Scholar 

  18. R.T. Rockafellar. Second-order optimality conditions in nonlinear programming obtained by way of epiderivatives. Mathematics of Operations Research, 14: 462–484, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  19. A. Shapiro and M.K.H. Fan. On eigenvalue optimization, 1993. Manuscript.

    Google Scholar 

  20. D. Ward. Calculus for parabolic second-order derivatives. Submitted to Canadian J. Math.

    Google Scholar 

  21. G.A. Watson. An algorithm for optimal 12 scaling of matrices. IMA Journal on Numerical Analysis, 1991. To appear.

    Google Scholar 

  22. G.A. Watson. Characterization of the subdifferential of some matrix norms. Linear Algebra and its Applications, 170: 33, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  23. R.S. Womersley. Local properties of algorithms for minimizing nonsmooth composite functions. Mathematical Programming, 32: 69–89, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  24. E. Yamakawa, M. Fukushima, and T. Ibaraki. An efficient trust region algorithm for minimizing nondifferentiable composite functions. SIAM Journal on Scientific and Statistical Computing, 10: 562–580, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  25. X.-J. Ye. On the local properties of algorithms for minimizing nonsmooth composite functions, 1991. Manuscript, Nanjing University.

    Google Scholar 

  26. Y. Yuan. On the superlinear convergence of a trust region algorithm for nonsmooth optimization. Mathematical Programming, 31: 269–285, 1985.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Overton, M.L., Ye, X. (1994). Towards Second-Order Methods for Structured Nonsmooth Optimization. In: Gomez, S., Hennart, JP. (eds) Advances in Optimization and Numerical Analysis. Mathematics and Its Applications, vol 275. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8330-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-8330-5_7

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4358-0

  • Online ISBN: 978-94-015-8330-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics