Results 221 to 230 of about 39,156 (263)

Admissibility Of Constraint Functions In Relaxation Labeling

[1988 Proceedings] Second International Conference on Computer Vision, 2005
In relaxation labeling, the domain model is incorporated into the system through the constraint functions ( compatibility coefficients). The selection of these functions is shown to be critical. In particular, for certain choices of the contraint functions, some processes will have a single nontrivial convergence point regardless of the initial ...
H. Isil Bozma, James S. Duncan
openaire   +1 more source

Relaxation function for the non-Debye relaxation spectra description

Chemical Physics, 2014
Abstract This study presents the new relaxation function describing the non-Debye relaxation phenomena. The relaxation function is based on a new theoretical model of the relaxation polarization. The non-Debye relaxation is explained with the model of nonlinear damped oscillator.
exaly   +2 more sources

Convex and concave relaxations of implicit functions

Optimization Methods and Software, 2014
A deterministic algorithm for solving nonconvex NLPs globally using a reduced-space approach is presented. These problems are encountered when real-world models are involved as nonlinear equality constraints and the decision variables include the state variables of the system. By solving the model equations for the dependent state variables as implicit
Matthew D. Stuber, Joseph K. Scott, Paul I. Barton   +2 more
openaire   +1 more source

RELAXATION OF FUNCTIONALS INVOLVING HOMOGENEOUS FUNCTIONS AND INVARIANCE OF ENVELOPES

Chinese Annals of Mathematics, 2002
It is well known that minimization problems involving functionals of the type : \(I\left( u\right) =\int_{\Omega }W\left( \nabla u\right) dx\) do not have solutions in the general case, that is without assumptions on \(W\) which imply the weak lower semicontinuity of \(I\) on appropriate Sobolev spaces.
Bousselsal, M., Le Dret, H.
openaire   +2 more sources

Relaxation in systems with hierarchical organization: Analytical derivation of the relaxation and dispersion functions

Physics Letters A, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dammar N. Badu, Koki Yokoi, Valerică Raicu   +2 more
openaire   +2 more sources

New relaxations for composite functions

2019
Mixed-integer nonlinear programs are typically solved using branch-and-bound algorithms. A key determinant of the success of such methods is their ability to construct tight and tractable relaxations. The predominant relaxation strategy used by most state-of-the-art solvers is the factorable programming technique.
openaire   +2 more sources

The Relaxed Work Functional in Linear Viscoelasticity

Mathematics and Mechanics of Solids, 2004
The relaxed work from a history H' to a history H is defined as the minimum work required to approach H via a sequence of continuations of H'. I prove three basic properties of the relaxed work: subadditivity, lower semicontinuity with respect to H for fixed H', and two dissipation inequalities.
openaire   +1 more source

THE GENERAL THEORY OF RELAXATION PROCESSES FOR CONVEX FUNCTIONALS

Russian Mathematical Surveys, 1970
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lyubich, Yu. I., Maĭstrovskiĭ, G. D.
openaire   +2 more sources

Multiscale relaxation of convex functionals

2003
Summary: The \(\Gamma\)-limit of a family of functionals \[ u\mapsto \int_\Omega f\Biggl({x\over\varepsilon}, {x\over \varepsilon^2}, D^su\Biggr)\,dx \] is obtained for \(s= 1,2\) and when the integrand \(f= f(x,y,v)\) is a continuous function, periodic in \(x\) and \(y\), and convex with respect to \(v\). The 3-scale limits of second-order derivatives
FONSECA I., ZAPPALE, ELVIRA
openaire   +3 more sources

Relaxation methods of minimization of pseudoconvex functions

Journal of Soviet Mathematics, 1989
See the preview in Zbl 0501.65025.
openaire   +1 more source