نتایج جستجو برای: geometrically quasiconvex functions

تعداد نتایج: 499291  

1999
Rita Gitik RITA GITIK

We generalize results about the classical Schottky groups to quasiconvex subgroups in negatively curved groups, answering a question of M. Bestvina.

2014
WEI-DONG JIANG FENG QI

In the paper, the authors prove that the generalized sine function sinp,q(x) and the generalized hyperbolic sine function sinhp,q(x) are geometrically concave and geometrically convex, respectively. Consequently, the authors verify a conjecture posed in the paper “B. A. Bhayo and M. Vuorinen, On generalized trigonometric functions with two parameters, J. Approx. Theory 164 (2012), no. 10, 1415–...

2000
N. Echebest M. T. Guardarucci

A biased Newton direction is introduced for minimizing quasiconvex functions with bounded level sets. It is a generalization of the usual Newton's direction for strictly convex quadratic functions. This new direction can be derived from the intersection of approximating hyperplanes to the epigraph at points on the boundary of the same level set. Based on that direction, an unconstrained minimiz...

Journal: :Topology and its Applications 2000

Journal: :The Quarterly Journal of Mathematics 2017

2018
Musa Furkan Keskin Osman Erdem Sinan Gezici

Light emitting diode (LED) based visible light positioning (VLP) networks can provide accurate location information in indoor environments. In this manuscript, we propose to employ cooperative localization for visible light networks by designing a VLP system configuration that involves multiple LED transmitters with known locations (e.g., on the ceiling) and visible light communication (VLC) un...

2006
A. NICOLAU

A natural interpolation problem in the cone of positive harmonic functions is considered and the corresponding interpolating sequences are geometrically described.

2015
Alireza Mohebi Ashtiani Paulo Augusto Valente Ferreira Felipe Ferreira Lopes

In this work we propose a continuous approach for solving one of the most studied problems in combinatorial optimization, known as the 0–1 knapsack problem. In the continuous space, the problem is reformulated as a convex generalized multiplicative problem, a special class of nonconvex problems which involves the minimization of a finite sum of products of convex functions over a nonempty conve...

2011
T. J. Sullivan H. Owhadi

This note reviews, compares and contrasts three notions of “distance” or “size” that arise often in concentration-ofmeasure inequalities. We review Talagrand’s convex distance and McDiarmid’s diameter, and consider in particular the normal distance on a topological vector space X , which corresponds to the method of Chernoff bounds, and is in some sense “natural” with respect to the duality str...

Journal: :Bulletin of the Australian Mathematical Society 1995

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید