Skip to main content
Log in

Second-Order Minimization Method for Nonsmooth Functions Allowing Convex Quadratic Approximations of the Augment

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

Abstract

Second-order methods play an important role in the theory of optimization. Due to the usage of more information about considered function, they give an opportunity to find the stationary point faster than first-order methods. Well-known and sufficiently studied Newton’s method is widely used to optimize smooth functions. The aim of this work is to obtain a second-order method for unconstrained minimization of nonsmooth functions allowing convex quadratic approximation of the augment. This method is based on the notion of coexhausters—new objects in nonsmooth analysis, introduced by V. F. Demyanov. First, we describe and prove the second-order necessary condition for a minimum. Then, we build an algorithm based on that condition and prove its convergence. At the end of the paper, a numerical example illustrating implementation of the algorithm is given.

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. Panin, V.M.: About second order method for descrete minimax problem. Comput. Math. Math. Phys. 19(1), 88–98 (1979). (in Russian)

    Article  MathSciNet  Google Scholar 

  2. Qi, L., Sun, J.: A nonsmooth version of Newtons method. Math. Program. 58(1–3), 353–367 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  3. Gardasevic-Filipovic, M., Duranovic-Milicic, N.: An algorithm using Moreau–Yosida regularization for minimization of a nondifferentiable convex function. Filomat 27(1), 15–22 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. Pshenichny, B.N.: Convex analysis and extremal problems. Nauka, Moscow (1980). (in Russian)

    Google Scholar 

  5. Demyanov, V.F., Rubinov, A.M.: Constructive nonsmooth analysis. Approximation and optimization, vol. 7. Peter Lang, Frankfurt am Main (1995)

    MATH  Google Scholar 

  6. Demyanov, V.F., Rubinov, A.M.: Exhaustive families of approximations revisited. From convexity to nonconvexity. Nonconvex optimization and its applications, vol. 55, pp. 43–50. Kluwer Academic, Dordrecht (2001)

    Chapter  Google Scholar 

  7. Demyanov, V.F.: Exhausters af a positively homogeneous function. Optimization 45(1–4), 13–29 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Demyanov, V.F.: Exhausters and convexificators—new tools in nonsmooth analysis. In: Demyanov, V., Rubinov, A. (eds.) Quasidifferentiability and related topics, pp. 85–137. Kluwer Academic Publishers, Dordrecht (2000)

    Chapter  Google Scholar 

  9. Demyanov, V.F., Roschina, V.A.: Optimality conditions in terms of upper and lower exhausters. Optimization 55(5–6), 525–540 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Abbasov, M.E., Demyanov, V.F.: Proper and adjoint exhausters in nonsmooth analysis: optimality conditions. J. Glob. Optim. 56(2), 569–585 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  11. Demyanov, V.F., Malozemov, V.N.: Introduction to minimax. Halsted Press/Wiley, New York (1974)

    Google Scholar 

  12. Dolgopolik, M.V.: Inhomogeneous convex approximations of nonsmooth functions. Russ. Math. 56(12), 28–42 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  13. Abbasov, M.E., Demyanov, V.F.: Extremum conditions for a nonsmooth function in terms of exhausters and coexhausters. Proc. Steklov Inst. Math. 269(1 Supplement), 6–15 (2010)

    Article  MATH  Google Scholar 

  14. Demyanov, V.F.: Proper exhausters and coexhausters in nonsmooth analysis. Optimization 61(11), 1347–1368 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  15. Abbasov, M.E., Demyanov, V.F.: Adjoint coexhausters in nonsmooth analysis and extremality conditions. J. Optim. Theory Appl. 156(3), 535–553 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  16. Minoux, M.: Mathematical programming: theory and algorithms. Wiley, New York (1986)

    MATH  Google Scholar 

Download references

Acknowledgments

The author dedicates the article to the blessed memory of Professor Vladimir Fedorovich Demyanov, whose ideas led to the appearance of this work. The work is supported by the Saint-Petersburg State University under Grant No. 9.38.205.2014.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. E. Abbasov.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Abbasov, M.E. Second-Order Minimization Method for Nonsmooth Functions Allowing Convex Quadratic Approximations of the Augment. J Optim Theory Appl 171, 666–674 (2016). https://doi.org/10.1007/s10957-015-0796-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-015-0796-7

Keywords

Mathematics Subject Classification

Navigation