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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
V.I. Arnold. On matrices depending on parameters. Russian Mathematical Surveys, 26: 29–43, 1971.
J.V. Burke. Descent methods for composite nondifferentiable optimization problems. Mathematical Programming, 33: 260–279, 1985.
J.V. Burke. Second order necessary and sufficient conditions for convex composite NDO. Mathematical Programming, 38: 287–302, 1987.
J.V. Burke and R. A. Poliquin. Optimality conditions for non-finite valued convex composite functions, 1992.
R.W. Chaney. On second derivatives for nonsmooth functions. Nonlinear Analysis: Theory, Methods and Applications, 9: 1189–1209, 1985.
F. H. Clarke. Optimization and Nonsniooth Analysis. John Wiley, New York, 1983.
T.F. Fairgrieve. The application of singularity theory to the computation of the Jordan canonical form. Master’s thesis, University of Toronto, 1986.
R. Fletcher. Practical Methods of Optimization. John Wiley, Chichester and New York, second edition, 1987.
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.
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.
M.R. Osborne. Finite Algorithms in Optimization and Data Analysis. John Wiley, Chichester and New York, 1985.
M.L. Overton. Large-scale optimization of eigenvalues. SIAM Journal on Optimization, 2: 88–120, 1992.
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.
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.
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.
R. Poliquin and R.T. R.ockafellar. A calculus of epi-derivatives applicable to optimization. Canadian Journal of Mathematics To appear.
R.T. Rockafellar. Convex Analysis. Princeton University Press, Princeton, N.J., 1970.
R.T. Rockafellar. Second-order optimality conditions in nonlinear programming obtained by way of epiderivatives. Mathematics of Operations Research, 14: 462–484, 1989.
A. Shapiro and M.K.H. Fan. On eigenvalue optimization, 1993. Manuscript.
D. Ward. Calculus for parabolic second-order derivatives. Submitted to Canadian J. Math.
G.A. Watson. An algorithm for optimal 12 scaling of matrices. IMA Journal on Numerical Analysis, 1991. To appear.
G.A. Watson. Characterization of the subdifferential of some matrix norms. Linear Algebra and its Applications, 170: 33, 1992.
R.S. Womersley. Local properties of algorithms for minimizing nonsmooth composite functions. Mathematical Programming, 32: 69–89, 1985.
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.
X.-J. Ye. On the local properties of algorithms for minimizing nonsmooth composite functions, 1991. Manuscript, Nanjing University.
Y. Yuan. On the superlinear convergence of a trust region algorithm for nonsmooth optimization. Mathematical Programming, 31: 269–285, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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