Convexity and concavity of Banach ideal spaces and imbedding theorems

1991 ◽  
Vol 31 (3) ◽  
pp. 373-379
Author(s):  
M. Z. Berkolaiko

1999 ◽  
Vol 8 (4) ◽  
pp. 307-315 ◽  
Author(s):  
SVEN ERICK ALM ◽  
JOHN C. WIERMAN

A simple geometric argument establishes an inequality between the sums of two pairs of first-passage times. This result is used to prove monotonicity, convexity and concavity results for first-passage times with cylinder and half-space restrictions.





2017 ◽  
Vol 5 (4RAST) ◽  
pp. 92-97
Author(s):  
K. M. Nagaraja ◽  
Vimala T

In this paper, convexity and concavity among Greek means are discussed and the results are interpreted with Vander monde's determinant.



1999 ◽  
Vol 103 (1) ◽  
pp. 27-49 ◽  
Author(s):  
M.A. Hernández ◽  
M.A. Salanova


1990 ◽  
Vol 42 (3) ◽  
pp. 509-531 ◽  
Author(s):  
Moshe Shaked ◽  
J. George Shanthikumar


2008 ◽  
Vol 343 (1) ◽  
pp. 337-351 ◽  
Author(s):  
Anna Kamińska ◽  
Anca M. Parrish






2017 ◽  
Vol 15 (1) ◽  
pp. 840-851 ◽  
Author(s):  
Yingfeng Zhao ◽  
Sanyang Liu ◽  
Hongwei Jiao

Abstract This study presents an efficient branch and bound algorithm for globally solving the minimax fractional programming problem (MFP). By introducing an auxiliary variable, an equivalent problem is firstly constructed and the convex relaxation programming problem is then established by utilizing convexity and concavity of functions in the problem. Other than usual branch and bound algorithm, an adapted partition skill and a practical reduction technique performed only in an unidimensional interval are incorporated into the algorithm scheme to significantly improve the computational performance. The global convergence is proved. Finally, some comparative experiments and a randomized numerical test are carried out to demonstrate the efficiency and robustness of the proposed algorithm.



Sign in / Sign up

Export Citation Format

Share Document