Displaying 81 – 100 of 348

Showing per page

Entropic approximation in kinetic theory

Jacques Schneider (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Approximation theory in the context of probability density function turns out to go beyond the classical idea of orthogonal projection. Special tools have to be designed so as to respect the nonnegativity of the approximate function. We develop here and justify from the theoretical point of view an approximation procedure introduced by Levermore [Levermore, J. Stat. Phys.83 (1996) 1021–1065] and based on an entropy minimization principle under moment constraints. We prove in particular...

Entropic Projections and Dominating Points

Christian Léonard (2010)

ESAIM: Probability and Statistics

Entropic projections and dominating points are solutions to convex minimization problems related to conditional laws of large numbers. They appear in many areas of applied mathematics such as statistical physics, information theory, mathematical statistics, ill-posed inverse problems or large deviation theory. By means of convex conjugate duality and functional analysis, criteria are derived for the existence of entropic projections, generalized entropic projections and dominating points. Representations...

Equivalent norms in some spaces of analytic functions and the uncertainty principle

Boris Paneah (1996)

Banach Center Publications

The main object of this work is to describe such weight functions w(t) that for all elements f L p , Ω the estimate w f p K ( Ω ) f p is valid with a constant K(Ω), which does not depend on f and it grows to infinity when the domain Ω shrinks, i.e. deforms into a lower dimensional convex set Ω . In one-dimensional case means that K ( σ ) : = K ( Ω σ ) as σ → 0. It should be noted that in the framework of the signal transmission problem such estimates describe a signal’s behavior under the influence of detection and amplification. This work...

Existence of solutions to weak nonlinear bilevel problems via MinSup and d.c. problems

Abdelmalek Aboussoror, Abdelatif Mansouri (2008)

RAIRO - Operations Research

In this paper, which is an extension of [4], we first show the existence of solutions to a class of Min Sup problems with linked constraints, which satisfy a certain property. Then, we apply our result to a class of weak nonlinear bilevel problems. Furthermore, for such a class of bilevel problems, we give a relationship with appropriate d.c. problems concerning the existence of solutions.

Extensions of convex functionals on convex cones

E. Ignaczak, A. Paszkiewicz (1998)

Applicationes Mathematicae

We prove that under some topological assumptions (e.g. if M has nonempty interior in X), a convex cone M in a linear topological space X is a linear subspace if and only if each convex functional on M has a convex extension on the whole space X.

External approximation of first order variational problems via W-1,p estimates

Cesare Davini, Roberto Paroni (2008)

ESAIM: Control, Optimisation and Calculus of Variations

Here we present an approximation method for a rather broad class of first order variational problems in spaces of piece-wise constant functions over triangulations of the base domain. The convergence of the method is based on an inequality involving W - 1 , p norms obtained by Nečas and on the general framework of Γ-convergence theory.

From Eckart and Young approximation to Moreau envelopes and vice versa

Jean-Baptiste Hiriart-Urruty, Hai Yen Le (2013)

RAIRO - Operations Research - Recherche Opérationnelle

In matricial analysis, the theorem of Eckart and Young provides a best approximation of an arbitrary matrix by a matrix of rank at most r. In variational analysis or optimization, the Moreau envelopes are appropriate ways of approximating or regularizing the rank function. We prove here that we can go forwards and backwards between the two procedures, thereby showing that they carry essentially the same information.

Currently displaying 81 – 100 of 348