Results 181 to 190 of about 3,067,533 (204)
Some of the next articles are maybe not open access.
A New Convex Loss Function For Multiple Instance Support Vector Machines
2020 25th International Conference on Pattern Recognition (ICPR), 2021We develop a novel multiple instance SVM based on maximizing the minimum witness rate (WR) among positive bags. We solve this nonlinear integer programming problem by the multiple instance SVM formulation with a convex loss function, where unknown integer labels of instances in positive bags are relaxed to real numbers between −1 and 1 using the ...
Sang-Baeg Kim, Jung-Man Bae
openaire +1 more source
On Integral Inequalities for Product and Quotient of Two Multiplicatively Convex Functions
Asian Research Journal of Mathematics, 2019 In this paper, we derived integral inequalities of Hermite-Hadamard type in the setting of multiplicative calculus for multiplicatively convex and convex functions. We also derived integral inequalities of Hermite-Hadamard type for product and quotient of multiplicatively convex and convex functions in multiplicative calculus.
Muhammad Aamir Ali +2 more
exaly +4 more sources
A convexity theorem for multiplicative functions
Optimization Letters, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
On the convexity of the multiplicative version of Karmarkar's potential function
Mathematical Programming, 1988The author shows that the multiplicative version of the potential function is strictly convex on the feasible region of the corresponding linear programming problem when the region is bounded, as is the case in the multiplicative version of Karmarkar's potential function.
openaire +2 more sources
Journal of Mathematical Analysis and Applications
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ting-Song Du
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ting-Song Du
exaly +3 more sources
On the convexity of the multiplicative potential and penalty functions and related topics
Mathematical Programming, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A multiple convex Lyapunov function for asynchronous control of discrete-time switched systems
Transactions of the Institute of Measurement and Control, 2021In this paper, the problem of asynchronous control for a class of discrete-time switched systems is investigated under mode-dependent integrated dwell time (MDIDT) switching. By constructing a time-dependent convex function, a multiple convex Lyapunov function (MCLF) is firstly proposed for the asynchronous control of the switched systems.
Jiahao Cui, Ruihua Wang, Shumin Fei
openaire +2 more sources
The Schur multiplicative and harmonic convexities of the complete symmetric function
Mathematische Nachrichten, 2011AbstractThis paper investigates the Schur multiplicative and harmonic convexities of the complete symmetric function \documentclass{article}\usepackage{amssymb}\pagestyle{empty}\begin{document}$F_n(x,r)=\sum _{i_1+i_2+\cdots +i_n=r}x_1^{i_1}x_2^{i_2}\ldots x_n^{i_n}$\end{document} and the function \documentclass{article}\usepackage{amssymb}\pagestyle ...
Chu, Y.-M., Wang, G.-D., Zhang, X.-H.
openaire +2 more sources
Computers & Operations Research, 1989
It is demonstrated how a multiple attribute utility function (MAUF) can be expressed as a quasi-concave or quasi-convex function using non-unique weights. The author discusses three types of local information on weights: unique (half-space), partial information on unique (convex- cone), and non-unique (nonconvex cone).
openaire +2 more sources
It is demonstrated how a multiple attribute utility function (MAUF) can be expressed as a quasi-concave or quasi-convex function using non-unique weights. The author discusses three types of local information on weights: unique (half-space), partial information on unique (convex- cone), and non-unique (nonconvex cone).
openaire +2 more sources
Minimization Technique for a Convex Function with Application to Multiple Regression Model
Optimization, 1988This paper develops an algorithm for estimating the parameters in a general multiple regression model, The estimator coincides with the maximum likelihood estimator when the errors have a probability density function of the type f(t) = C 1 exp ( −φ(t)), where φ is a convex and symmetric function but not necessarily differentiable.
Wansoo T. Rhee, K. Anthony Rhee
openaire +1 more source