On constrained extrema

نویسندگان

چکیده

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

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

منابع مشابه

On constrained extrema

Assume that I and J are smooth functionals defined on a Hilbert space H. We derive sufficient conditions for I to have a local minimum at y subject to the constraint that J is constantly J(y). The first order necessary condition for I to have a constrained minimum at y is that for some constant λ, I ′ y +λJ ′ y is identically zero. Here I ′ y and J ′ y are the Fréchet derivatives of I and J at ...

متن کامل

Second Derivative Test for Constrained Extrema

This handout presents the second derivative test for a local extrema of a Lagrange multiplier problem. The Section 1 presents a geometric motivation for the criterion involving the second derivatives of both the function f and the constraint function g. The main result is given in section 3, with the special cases of one constraint given in Sections 4 and 5 for two and three dimensions respecti...

متن کامل

Suucient Conditions for Multiply Constrained Extrema

on a Hilbert space H. We derive suucient conditions for I to have a strong local minimum at a point y subject to the n constraints J i = 0.

متن کامل

An analysis on extrema and constrained bounds for the soft Pomeron intercept

We investigate some aspects and consequences of the extrema bounds for the soft Pomeron intercept, recently determined by means of global fits to pp and p̄p total cross section data at both accelerator and cosmic-ray energy regions (scattering data). We also examine the effects of the secondary Reggeons by introducing fitted trajectories from Chew-Frautschi plots (spectroscopy data) and determin...

متن کامل

On Message Complexity of Extrema Propagation Techniques

In this paper we discuss the message complexity of some variants of the Extrema Propagation techniques in wireless networks. We show that the average message complexity, counted as the number of messages sent by each given node, is O (log n), where n denotes the size of the network. We indicate the connection between our problem and the well known and deeply studied problem of the number of rec...

متن کامل

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


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

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1996

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1996.176.557