Skip to main content
Log in

Convex composite minimization withC 1,1 functions

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, we present second-order optimality conditions for convex composite minimization problems in which the objective function is a composition of a finite-valued or a nonfinite-valued lower semicontinuous convex function and aC 1,1 function. The results provide optimality conditions for composite problems under reduced differentiability requirements.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Burke, J. V.,Second-Order Necessary and Sufficient Conditions for Convex Composite NDO, Mathematical Programming, Vol. 38, pp. 287–302, 1987.

    Google Scholar 

  2. Burke, J. V., andPoliquin, R. A.,Optimality Conditions for Nonfinite-Valued Convex Composite Functions, Mathematical Programming, Vol. 57B, pp. 103–120, 1992.

    Google Scholar 

  3. Fletcher, R.,Practical Methods of Optimization, John Wiley, New York, New York, 1987.

    Google Scholar 

  4. Ioffe, A. D.,Necessary and Sufficient Conditions for a Local Minimum, Part 3: Second-Order Conditions and Augmented Duality, SIAM Journal on Control and Optimization, Vol. 17, pp. 266–288, 1979.

    Google Scholar 

  5. Rockafellar, R. T.,First- and Second-Order Epidifferentiability in Nonlinear Programming, Transactions of the American Mathematical Society, Vol. 307, pp. 75–108, 1988.

    Google Scholar 

  6. Rockafellar, R. T.,Second-Order Optimality Conditions in Nonlinear Programming Obtained by Way of Epiderivatives, Mathematics of Operations Research, Vol. 14, pp. 462–484, 1989.

    Google Scholar 

  7. Jeyakumar, V.,Composite Nonsmooth Programming with Gâteaux Differentiability, SIAM Journal on Optimization, Vol. 1, pp. 30–41, 1991.

    Google Scholar 

  8. Jeyakumar, V., andYang, X. Q.,Convex Composite Multi-Objective Nonsmooth Programming, Mathematical Programming, Vol. 59, pp. 325–343, 1993.

    Google Scholar 

  9. Cominetti, R., andCorrea, R.,A Generalized Second-Order Derivative in Nonsmooth Optimization, SIAM Journal on Control and Optimization, Vol. 28, pp. 789–809, 1990.

    Google Scholar 

  10. Yang, X. Q., andJeyakumar, V.,Generalized Second-Order Directional Derivatives and Optimization with C 1,1 Functions, Optimization, Vol. 26, pp. 165–185, 1992.

    Google Scholar 

  11. Yang, X. Q.,Generalized Second-Order Directional Derivatives and Optimality Conditions, Nonlinear Analysis: Theory, Methods, and Applications, Vol. 23, pp. 767–784, 1994.

    Google Scholar 

  12. Aubin, J. P., andEkeland, I.,Applied Nonlinear Analysis, John Wiley, New York, New York, 1984.

    Google Scholar 

  13. Rockafellar, R. T.,Conjugate Duality and Optimization, SIAM Publications, Philadelphia, Pennsylvania, 1974.

    Google Scholar 

  14. Jeyakumar, V.,Duality and Infinite-Dimensional Optimization, Nonlinear Analysis: Theory, Methods, and Applications, Vol. 15, pp. 1111–1122, 1990.

    Google Scholar 

  15. Ioffe, A. D.,Necessary and Sufficient Conditions for a Local Minimum, Part 2: Conditions of Levitin-Miljutin-Osmolovskii Type, SIAM Journal on Control and Optimization, Vol. 17, pp. 251–265, 1979.

    Google Scholar 

  16. Clarke, F. H.,Optimization and Nonsmooth Analysis, John Wiley, New York, New York, 1983.

    Google Scholar 

  17. Jeyakumar, V.,On Optimality Conditions in Nonsmooth Inequality Constrained Minimization, Numerical Functional Analysis and Optimization Vol. 2, pp. 535–546, 1987.

    Google Scholar 

  18. Ben-Tal, A., andZowe, J.,Necessary and Sufficient Optimality Conditions for a Class of Nonsmooth Minimization Problems, Mathematical Programming, Vol. 24, pp. 70–91, 1982.

    Google Scholar 

  19. Hiriart-Urruty, J. B., Strodiot, J. J., andHien Nguyen, V.,Generalized Hessian Matrix and Second-Order Optimality Conditions for Problems with C 1,1 Data, Applied Mathematics and Optimization, Vol. 11, pp. 43–56, 1984.

    Google Scholar 

  20. Holmes, R. B.,A Course on Optimization and Best Approximation, Springer Verlag, New York, New York, 1972.

    Google Scholar 

  21. Ioffe, A. D.,Second-Order Conditions in Nonlinear Nonsmooth Problems of Semi-Infinite Programming, Semi-Infinite Programming and Applications, Edited by A. V. Fiacco and K. O. Kortanek, Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, Germany, Vol. 215, pp. 262–280, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by R. A. Tapia

This paper is a revised version of the Departmental Preliminary Report AM92/32, School of Mathematics, University of New South Wales, Kensington, NSW, Australia.

Research of this author was supported in part by an Australian Research Council Grant.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jeyakumar, V., Yang, X.Q. Convex composite minimization withC 1,1 functions. J Optim Theory Appl 86, 631–648 (1995). https://doi.org/10.1007/BF02192162

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02192162

Key Words

Navigation