Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema
Publication:5139113
DOI10.20537/VM190402zbMath1479.26006OpenAlexW3005160615MaRDI QIDQ5139113
Publication date: 7 December 2020
Published in: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/vuu696
nondifferentiable optimizationextreme subarguments (subabscissae) and epiarguments (epiabscissae) of functiongray Takagi function of Kobayashinatural convex and concave envelopes of function
Nonconvex programming, global optimization (90C26) Singular functions, Cantor functions, functions with other special properties (26A30) Nondifferentiability (nondifferentiable functions, points of nondifferentiability), discontinuous derivatives (26A27)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chebyshev approximation by linear combinations of fixed knot polynomial splines with weighting functions
- The Takagi function: a survey
- Distribution of the sum-of-digits function of random integers: a survey
- A study of regularization techniques of nondifferentiable optimization in view of application to hemivariational inequalities
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- On (signed) Takagi-Landsberg functions: \(p\)th variation, maximum, and modulus of continuity
- Introduction to Nonsmooth Optimization
- Digital Sum Problems for the Gray Code Representation of Natural Numbers
- Global extrema of the Gray Takagi function of Kobayashi and binary digital sums
- Convex Analysis
This page was built for publication: Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema
