Skip to main content
Log in

Convexity with respect to families of sections and lines and their application in optimization

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

The main goal of this paper is to introduce two generalized convexity notions, to examine their properties and their use in optimization theory, in particular, to deduce necessary and sufficient first order conditions.

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.

Fig. 1
Fig. 2

Similar content being viewed by others

Notes

  1. The original two-place Rosenbrock function is the following \(f(x,y):=100(y-x^2)^2+(1-x)^2\) (see [18]), which is a well-known test function in numerical optimization.

References

  1. Avriel, M., Zang, I.: Generalized arcwise-connected functions and characterizations of local–global minimum properties. J. Optim. Theory Appl. 32(4), 407–425 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  2. Burai, P.: Necessary and sufficient condition on global optimality without convexity and second order differentiability. Optim. Lett. 7(5), 903–911 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. Burai, P.: Local–global minimum property in unconstrained minimization problems. J. Optim. Theory Appl. (2014)

  4. Burai, P., Házy, A.: On orlicz-convex functions. In: Politeh Timişoara (ed.) Proceedings of the Twelfth Symposium of Mathematics and its Applications, pp. 73–78 (2010)

  5. Burai, P., Házy, A., Juhász, T.: Bernstein-doetsch type results for \(s\)-convex functions. Publ. Math. Debrecen 75(1–2), 23–31 (2009)

    MathSciNet  MATH  Google Scholar 

  6. Ekeland, I., Temam, R.: Convex Analysis and Variational Problems. North-Holland Publishing Co., Amsterdam. Translated from the French, Studies in Mathematics and its Applications, Vol. 1 (1976)

  7. Ferreira, O.P.: Convexity with respect to a differential equation. J. Math. Anal. Appl. 315(2), 626–641 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hudzik, H., Maligranda, L.: Some remarks on \(s\)-convex functions. Aequationes Math. 48(1), 100–111 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Llinares, J.-V.: Abstract convexity, some relations and applications. Optimization 51(6), 797–818 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Maksa, Gy, Páles, Zs: The equality case in some recent convexity inequalities. Opuscula Math. 31(2), 269–277 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Matuszewska, W.: Regularly increasing functions in connection with the theory of \(L^{*\phi }\)-spaces. Studia Math. 21, 317–344 (1961/1962)

  12. Orlicz, W.: A note on modular spaces. I. Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 9, 157–162 (1961)

    MathSciNet  MATH  Google Scholar 

  13. Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables, volume 30 of Classics in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA. Reprint of the 1970 original (2000)

  14. Páles, Zs: On approximately convex functions. Proc. Am. Math. Soc. 131(1), 243–252 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Pini, R.: Convexity along curves and invexity. Optimization 29(4), 301–309 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  16. Rapcsák, T.: Geodesic convexity in nonlinear optimization. J. Optim. Theory Appl. 69(1), 169–183 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  17. Rapcsák, T.: Smooth Nonlinear Optimization in \({\bf R}^n\), Volume 19 of Nonconvex Optimization and its Applications. Kluwer Academic, Dordrecht (1997)

    Book  MATH  Google Scholar 

  18. Rosenbrock, H.H.: An automatic method for finding the greatest or least value of a function. Comput. J. 3, 175–184 (1960/1961)

Download references

Acknowledgments

This research was supported by the European Union and the State of Hungary, co-financed by the European Social Fund in the framework of TÁMOP-4.2.4.A/ 2-11/1-2012-0001 “National Excellence Program” and by the Hungarian Research Fund (OTKA) (Grant No.: NK81402).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pál Burai.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Burai, P. Convexity with respect to families of sections and lines and their application in optimization. J Glob Optim 64, 649–662 (2016). https://doi.org/10.1007/s10898-015-0327-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-015-0327-y

Keywords

Mathematics Subject Classification

Navigation