Skip to main content
SpringerLink
Log in

Some Methods for Minimizing of d.c. Functions

  • Conference paper
  • First Online:
Computational Science and Its Applications – ICCSA 2019 (ICCSA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11622))

Included in the following conference series:

Abstract

In the paper, we present algorithms for minimization of d.c. functions (difference of two convex functions) on the whole space \(R^n\). Many nonconvex optimization problems can be described using these functions. D.c. functions are used in various applications especially in optimization, but the problem to characterize them is not trivial, due to the fact that these functions are not differentiable and certainly are not convex. The class of these functions is contained in the class of quasidifferentiable functions. Proposed algorithms are based on known necessary optimality conditions and d.c. duality. Convergence to \(\inf \)-stationary points is established under fairly general natural assumptions.

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

Access this chapter

Log in via an institution
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 EPUB and 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Hiriart-Urruty, J.-B.: From convex minimization to nonconvex minimization: necessary and sufficient conditions for global optimality. In: Clarke, F.N., Demyanov, V.F., Giannessi, F. (eds.) Nonsmooth Optimization and Related Topics. Ettore Majorana International Science Series, vol. 43, pp. 219–239. Springer, Boston (1989). https://doi.org/10.1007/978-1-4757-6019-4_13

    Chapter  MATH  Google Scholar 

  2. Martínez-Legaz, J.-E., Volle, M.: Duality in D.C. programming: the case of several D.C. constraints. J. Math. Anal. Appl. 237(2), 657–671 (1999). https://doi.org/10.1006/jmaa.1999.6496

    Article  MathSciNet  Google Scholar 

  3. Polyakova, L.N.: Necessary conditions for an extremum of quasidifferentiable functions. Vestnik St. Petersburg Univ. Math. 13, 57–62 (1980). (In Russian)

    MathSciNet  MATH  Google Scholar 

  4. Polyakova, L.: On global unconstrained minimization of the difference of polyhedral functions. J. Glob. Optim. 50(2), 179–195 (2011). https://doi.org/10.1007/s10898-010-9589-6

    Article  MathSciNet  MATH  Google Scholar 

  5. Polyakova, L.N., Karelin, V.V.: On a continuous method for minimizing of nonsmooth functions. In: Petrosyan, L.A., Zhabko, A.P. (eds.) International Conference “Stability and Control Processes” in Memory of V.I. Zubov SCP 2015, pp. 338–341. IEEE (2015). https://doi.org/10.1109/SCP.2015.7342133

  6. Stavroulakis, G.E., Polyakova, L.N.: Difference convex opitimization techniques in nonsmooth computational mechanics. Optim. Meth. Softw. 2, 57–81 (1996). https://doi.org/10.1080/10556789608805644

    Article  MATH  Google Scholar 

  7. Strekalovskij, A.S.: To a problem of a global extremum. Dokl. USSR Acad. Sci. 292(5), 1062–1066 (1989). (In Russian)

    MathSciNet  Google Scholar 

  8. Tao, P.D., Hoai An, L.T.: Convex analysis approaches to DC programming: theory, algorithms and applications. Acta Math. Vietnam. 22(1), 289–355 (1997)

    MathSciNet  MATH  Google Scholar 

  9. Thoai, N.V.: A modified version of Tuy’s method for solving D.C. programming problems. Optimization 19(5), 665–674 (1988)

    Article  MathSciNet  Google Scholar 

  10. Törn, A., Žilinskas, A. (eds.): Global Optimization. LNCS, vol. 350. Springer, Heidelberg (1989). https://doi.org/10.1007/3-540-50871-6

    Book  MATH  Google Scholar 

  11. Tuy, H.: Global minimization of a difference of two convex functions. Math. Program. Study 30, 150–182 (1983)

    Article  MathSciNet  Google Scholar 

  12. Leichtweiß, K.: Konvexe Mengen. Hochschultext, 1st edn. Springer-Verlag, Berlin (1980)

    Book  Google Scholar 

  13. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    Book  Google Scholar 

  14. Demyanov, V.F., Rubinov, A.M.: Quasidifferential Calculus. Optimization Software Inc. Publications Division, New-York (1986)

    Book  Google Scholar 

  15. Demyanov, V.F., Stavroulakis, G.E., Polyakova, L.N., Panagiotopoulos, P.D.: Quasidifferentiability and Nonsmooth Modelling in Mechanics Engineering and Economics. Kluwer Academic, Dordrecht (1996)

    Book  Google Scholar 

  16. Stankova, E.N., Balakshiy, A.V., Petrov, D.A., Shorov, A.V., Korkhov, V.V.: Using technologies of OLAP and machine learning for validation of the numerical models of convective clouds. In: Gervasi, O., et al. (eds.) ICCSA 2016. LNCS, vol. 9788, pp. 463–472. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42111-7_36

    Chapter  Google Scholar 

  17. Stankova, E.N., Ismailova, E.T., Grechko, I.A.: Algorithm for processing the results of cloud convection simulation using the methods of machine learning. In: Gervasi, O., et al. (eds.) ICCSA 2018. LNCS, vol. 10963, pp. 149–159. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-95171-3_13

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. St. Petersburg State University, 7/9, Universitetskaya nab., St. Petersburg, 199034, Russia

    L. Polyakova, V. Karelin, S. Myshkov & E. Stankova

Authors
  1. L. Polyakova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Karelin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Myshkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. E. Stankova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to L. Polyakova .

Editor information

Editors and Affiliations

  1. Covenant University, Ota, Nigeria

    Sanjay Misra

  2. University of Perugia, Perugia, Italy

    Osvaldo Gervasi

  3. University of Basilicata, Potenza, Italy

    Beniamino Murgante

  4. Saint Petersburg State University, Saint Petersburg, Russia

    Elena Stankova

  5. Saint Petersburg State University, Saint Petersburg , Russia

    Vladimir Korkhov

  6. Polytechnic University of Bari, Bari, Italy

    Carmelo Torre

  7. University of Minho, Braga, Portugal

    Ana Maria A.C. Rocha

  8. Monash University, Clayton, VIC, Australia

    David Taniar

  9. Kyushu Sangyo University, Fukuoka, Japan

    Bernady O. Apduhan

  10. Polytechnic University of Bari, Bari, Italy

    Eufemia Tarantino

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Polyakova, L., Karelin, V., Myshkov, S., Stankova, E. (2019). Some Methods for Minimizing of d.c. Functions. In: Misra, S., et al. Computational Science and Its Applications – ICCSA 2019. ICCSA 2019. Lecture Notes in Computer Science(), vol 11622. Springer, Cham. https://doi.org/10.1007/978-3-030-24305-0_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-24305-0_49

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-24304-3

  • Online ISBN: 978-3-030-24305-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation