Minimization of nonsmooth integral functionals

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimization of Nonsmooth Convex Functionals in Banach Spaces

We develop a uniied framework for convergence analysis of subgradient and subgradient projection methods for minimization of nonsmooth convex functionals in Banach spaces. The important novel features of our analysis are that we neither assume that the functional is uniformly or strongly convex, nor use regularization techniques. Moreover, no boundedness assumptions are made on the level sets o...

متن کامل

Minimization of entropy functionals

Entropy functionals (i.e. convex integral functionals) and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on the constraint set. Dual equalities and characterizations of the minimizers are obtained with weak constraint qualifications.

متن کامل

Coercivity properties for order nonsmooth functionals

A differential coercivity result is established for a class of order nonsmooth functionals fulfilling an appropriate Palais-Smale condition. The core of this approach is an asymptotic type statement involving such functionals, obtained by means of the monotone variational principle in Turinici [An. Şt. UAIC Iaşi, 36 (1990), 329-352].

متن کامل

Lower Semicontinutty of Integral Functionals

It is shown that the integral functional I(y,z) = J"0 f(t,y(t), z(t))dp. is lower semicontinuous on its domain with respect to the joint strong convergence of yk -» y in Lp(G) and the weak convergence of zk -» z in LAG), where 1 < p < oo and 1 < q < oo, under the following conditions. The function/: (t,x,w) -*f(t,x,w) is measurable in / for fixed (x, w), is continuous in (x, w) for a.e. /, and ...

متن کامل

Linearly Constrained Nonsmooth and Nonconvex Minimization

Motivated by variational models in continuum mechanics, we introduce a novel algorithm for performing nonsmooth and nonconvex minimizations with linear constraints. We show how this algorithm is actually a natural generalization of well-known non-stationary augmented Lagrangian methods for convex optimization. The relevant features of this approach are its applicability to a large variety of no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences

سال: 1992

ISSN: 0161-1712,1687-0425

DOI: 10.1155/s0161171292000899