Results 31 to 40 of about 225,326 (278)
Set-Theoretic Inequalities Based on Convex Multi-Argument Approximate Functions via Set Inclusion
Journal of Function Spaces, 2022 Hypersoft set is a novel area of study which is established as an extension of soft set to handle its limitations. It employs a new approximate mapping called multi-argument approximate function which considers the Cartesian product of attribute-valued ...
Atiqe Ur Rahman +3 more
doaj +1 more source
Optimizing condition numbers [PDF]
, 2009 In this paper we study the problem of minimizing condition numbers over a compact convex subset of the cone of symmetric positive semidefinite $n\times n$ matrices. We show that the condition number is a Clarke regular strongly pseudoconvex function.
Jane J. Ye, Lewis A.S., Pierre Maréchal
core +1 more source
On strongly generalized convex functions
Filomat, 2017 The main objective of this article is to introduce the notion of strongly generalized convex functions which is called as strongly ?-convex functions. Some related integral inequalities of Hermite-Hadamard and Hermite-Hadamard-Fej?r type are also obtained. Special cases are also investigated.
Awan, Muhammad Uzair +3 more
openaire +2 more sources
Advances in Difference Equations, 2021 Some new integral inequalities for strongly ( α , h − m ) $(\alpha ,h-m)$ -convex functions via generalized Riemann–Liouville fractional integrals are established.
Ghulam Farid +4 more
doaj +1 more source
Around strongly operator convex functions
Linear Algebra and its Applications15 ...
Nahid Gharakhanlu +1 more
openaire +2 more sources
On strongly $h$-convex functions
Annals of Functional Analysis, 2011 We introduce the notion of strongly $h$-convex functions (defined on a normed space) and present some properties and representations of such functions. We obtain a characterization of inner product spaces involving the notion of strongly $h$-convex functions. Finally, a Hermite-Hadamard-type inequality for strongly $h$-convex functions
Angulo, Hiliana +3 more
openaire +2 more sources
Coordinate strongly s-convex functions and related results [PDF]
Journal of Mathematical Inequalities, 2020 Summary: In this article, we give non-trivial examples of coordinates-convex functions which are not \(s\)-convex functions. Also, we present a new class of coordinate strongly \(s\)-convex functions. We prove that every strongly \(s\)-convex function is coordinate strongly \(s\)-convex function but the converse is not generally true.
Ullah, Syed Zaheer +3 more
openaire +1 more source
Adaptive Restart of the Optimized Gradient Method for Convex Optimization
, 2017 First-order methods with momentum such as Nesterov's fast gradient method are very useful for convex optimization problems, but can exhibit undesirable oscillations yielding slow convergence rates for some applications.
Fessler, Jeffrey A., Kim, Donghwan
core +1 more source
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
, 2009 The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program.
E. Kalai +10 more
core +3 more sources
Structural Results on the HMLasso
AxiomsHMLasso (Lasso with High Missing Rate) is a useful technique for sparse regression when a high-dimensional design matrix contains a large number of missing data. To solve HMLasso, an appropriate positive semidefinite symmetric matrix must be obtained. In
Shin-ya Matsushita, Hiromu Sasaki
doaj +1 more source