We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save this undefined to your undefined account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your undefined account.
Find out more about saving content to .
To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We investigate the minima of functionals of the form $$\int_{[a,b]}g(\dot u(s)){\rm d}s$$where g is strictly convex. The admissible functions $u:[a,b]\longrightarrow\mathbb{R}$ are not necessarily convex and satisfy $u\leq f$ on [a,b], u(a)=f(a), u(b)=f(b), f is a fixed function on [a,b].We show that the minimum is attained by $\bar f$, the convex envelope of f.
The signed similarities aggregation problem is solved with a booleanmethod derived from the Faure and Malgrange algorithm.The method is adequate either for integer similarities orreal similarites, and multiple solutions can be enumerated.It needs a space amount equal to three times the input data size.