Optimality conditions for non-finite valued convex composite functions
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Burke (1987) has recently developed second-order necessary and sufficient conditions for convex composite optimization in the case where the convex function is finite valued. In this note we present a technique for reducing the infinite valued case to the finite valued one. We then use this technique to extend the results in Burke (1987) to the case in which the convex function may take infinite values. We conclude by comparing these results with those established by Rockafellar (1989) for the piecewise linear-quadratic case.
- J.V. Burke, “An exact penalization viewpoint of constrained optimization,”SIAM Journal on Control and Optimization 29 (1991).
- J.V. Burke, “Second order necessary and sufficient conditions for convex composite NDO,”Mathematical Programming 38 (1987) 287–302.
- JV. Burke, “Descent methods for composite nondifferentiable optimization problems,”Mathematical Programming 33 (1985) 260–279.
- F.H. Clarke,Optimization and Nonsmooth Analysis (Wiley, New York, 1983).
- R. Fletcher,Practical Methods of Optimization (Wiley, New York, 1987).
- R. Fletcher, “A model algorithm for composite nondifferentiable optimization problems,”Mathematical Programming Study 17 (1982) 67–76.
- A. D. Ioffe, “Necessary and sufficient conditions for a local minimum 2: Conditions of Levitin—Miljutin—Osmolovskii type,”SIAM Journal on Control and Optimization 17 (1979) 251–265.
- K. Madsen, “Minimization of non-linear approximation functions,” Ph.D Thesis, Institute for Numerical Analysis, Technical University of Denmark (Lyngby, Denmark, 1985).
- O. L. Mangasarian and S. Fromovitz, “The Fritz John necessary optimality conditions in the presence of equality and inequality constraints,”Journal of Mathematical Analysis and Applications 17 (1967) 37–47.
- M.R. Osborne and G.A. Watson, “Nonlinear approximation problems in vector norms,” in: G.A. Watson, ed.,Numerical Analysis (Dundee 1977), Lecture Notes in Mathematics No. 630 (Springer, New York, 1978) pp. 115–132.
- R.A. Poliquin, “Proto-differentiation of subgradient set-valued mappings,”Canadian Journal of Mathematics XLII(3) (1990) 520–532.
- M.J.D. Powell, “General algorithms for discrete nonlinear approximation calculations,” in: C.K. Chui, L.L. Schumaker and J.D. Ward, eds.,Approximation Theory IV (Academic Press, New York, 1983) pp. 187–218.
- R.T. Rockafellar, “First-and second-order epi-differentiability in nonlinear programming,”Transactions of the American Mathematical Society 307 (1988) 75–108.
- R.T. Rockafellar, “Second-order optimality conditions in nonlinear programming obtained by way of epi-derivatives,”Mathematics of Operations Research 14 (1989) 462–484.
- R.T. Rockafellar, “Extensions of subgradient calculus with applications to optimization,”Nonlinear Analysis 9 (1985) 665–698.
- R.T. Rockafellar, “Directionally Lipschitzian functions and subdifferential calculus,”Proceedings of the London Mathematical Society 39 (1979) 331–355.
- R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
- R.J.-B. Wets, “Convergence of convex functions, variational inequalities and convex optimization problems,” in: R. Cottle, F. Giannessi and J.-L. Lions, eds.,Variational Inequalities and Complimentary Problems (Wiley, New York, 1980) pp. 375–403.
- Optimality conditions for non-finite valued convex composite functions
Volume 57, Issue 1-3 , pp 103-120
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Convex composite functions
- second-order optimality conditions
- constraint qualification
- Industry Sectors