نتایج جستجو برای: log convex function

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

Journal: :IEEE Trans. Signal Processing 2017
Renliang Gu Aleksandar Dogandzic

We develop a projected Nesterov’s proximal-gradient (PNPG) approach for sparse signal reconstruction that combines adaptive step size with Nesterov’s momentum acceleration. The objective function that we wish to minimize is the sum of a convex differentiable data-fidelity (negative log-likelihood (NLL)) term and a convex regularization term. We apply sparse signal regularization where the signa...

Journal: :International Journal of Computational Intelligence Systems 2021

Abstract In the preset study, we introduce new class of convex fuzzy-interval-valued functions which is called log- h -convex (log- FIVFs) by means fuzzy order relation. We have also investigated some properties FIVFs. Using this class, present Jensen and Hermite–Hadamard inequalities (HH-inequalities). Moreover, useful examples are presented to verify HH-inequalities for Several known special ...

Journal: :International Journal of Mathematics and Mathematical Sciences 1988

Journal: :CoRR 2015
Jiaqian Yu Matthew B. Blaschko

Learning with non-modular losses is an important problem when sets of predictions are made simultaneously. The main tools for constructing convex surrogate loss functions for set prediction are margin rescaling and slack rescaling. In this work, we show that these strategies lead to tight convex surrogates iff the underlying loss function is increasing in the number of incorrect predictions. Ho...

2007
Laurent El Ghaoui

We consider the problem of bounding from above the log-partition function corresponding to second-order Ising models for binary distributions. We introduce a new bound, the cardinality bound, which can be computed via convex optimization. The corresponding error on the logpartition function is bounded above by twice the distance, in model parameter space, to a class of “standard” Ising models, ...

Journal: :Applied Mathematics Letters 2021

Given a semi-convex potential V on convex and bounded domain Ω, we consider the Jordan–Kinderlehrer–Otto scheme for Fokker–Planck equation with V, which defines, fixed time step τ>0, sequence of densities ρk∈P(Ω). Supposing that is α-convex, i.e. D2V≥αI, prove Lipschitz constant logρ+V satisfies following inequality: Lip(log(ρk+1)+V)(1+ατ)≤Lip(log(ρk)+V). This provides exponential decay if α>0,...

Journal: :Annals of Probability 2023

We prove that the (B) conjecture and Gardner–Zvavitch are true for all log-concave measures rotationally invariant, extending previous results known Gaussian measures. Actually, our result apply beyond case of measures, instance, to Cauchy as well. For proof, new sharp weighted Poincaré inequalities obtained even probability with respect a invariant measure.

Journal: :Stochastic Processes and their Applications 2021

We establish formulae for the derivative of Poincar\'e constant Gibbs measures on both compact domains and all $\R^d$. As an application, we show that if (not necessarily convex) Hamiltonian is increasing function, then strictly decreasing in inverse temperature, vice versa. Applying this result to $O(2)$ model allows us give a sharpened upper bound its constant. further exhibits qualitatively ...

Journal: :Journal of Intelligent and Robotic Systems 2012
Xichuan Lin Shuxiang Guo

Research on underwater robots is attracting increased attention around the world. Various kinds of underwater robots have been developed, using an assortment of shapes, sizes, weights, and propulsion methods. In this paper, we propose a novel underwater robot, employing a spherical hull and equipped with multiple vectored water-jet-based thrusters. The overall design of the robot is first intro...

2004200520062007200820092010201120122013201420152016201720182019202020212022202304000080000

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

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