Results 231 to 240 of about 441,585 (267)
Some of the next articles are maybe not open access.
Neural Computation, 2003
The concave-convex procedure (CCCP) is a way to construct discrete-time iterative dynamical systems that are guaranteed to decrease global optimization and energy functions monotonically. This procedure can be applied to almost any optimization problem, and many existing algorithms can be interpreted in terms of it.
Yuille, A. L., Rangarajan, Anand
openaire +3 more sources
The concave-convex procedure (CCCP) is a way to construct discrete-time iterative dynamical systems that are guaranteed to decrease global optimization and energy functions monotonically. This procedure can be applied to almost any optimization problem, and many existing algorithms can be interpreted in terms of it.
Yuille, A. L., Rangarajan, Anand
openaire +3 more sources
Concave reagents. 12. Polymerfixation of Concave Pyridines
Journal f�r Praktische Chemie/Chemiker-Zeitung, 1992Via a metal ion template directed synthesis and a high dilution cyclization, a bimacrocyclic 4-benzyloxyethoxy-substituted concave pyridine 8 was synthesized from dialdehyde 3, diamine 4 and diacyl dichloride 7 in 54% overall yield. Pd-catalyzed hydrogenolysis of 8 afforded the OH-substituted concave pyridine 9 which could be attached to a Merrifield ...
Ulrich L�ning, Matthias Gerst
openaire +1 more source
Log-concave and concave distributions in reliability
Naval Research Logistics, 1999Summary: Nonparametric classes of life distributions are usually based on the pattern of aging in some sense. The common parametric families of life distributions also feature monotone aging. We consider the class of log-concave distributions and the subclass of concave distributions. The work is motivated by the fact that most of the common parametric
Sengupta, Debasis, Nanda, Asok K.
openaire +2 more sources
BIT Numerical Mathematics, 2000
Interval arithmetic provides various techniques to construct upper and lower bounds of function values \(f(x)\), \(x\in X\) where \(X\) is a \(n\)-dimensional box. Well-known means for obtaining these bounds are interval extensions. The bounds, however, can be quite crude.
openaire +2 more sources
Interval arithmetic provides various techniques to construct upper and lower bounds of function values \(f(x)\), \(x\in X\) where \(X\) is a \(n\)-dimensional box. Well-known means for obtaining these bounds are interval extensions. The bounds, however, can be quite crude.
openaire +2 more sources
A REPRESENTATION RESULT FOR CONCAVE SCHUR CONCAVE FUNCTIONS
Mathematical Finance, 2005A representation result is provided for concave Schur concave functions on L∞(Ω). In particular, it is proven that any monotone concave Schur concave weakly upper semicontinuous function is the infinimum of a family of nonnegative affine combinations of Choquet integrals with respect to a convex continuous distortion of the underlying probability.
openaire +3 more sources
The Mathematics Teacher, 1963
Finding the sum of the interior and exterior angles of a concave ...
Roslyn M. Berman, Martin Berman
openaire +1 more source
Finding the sum of the interior and exterior angles of a concave ...
Roslyn M. Berman, Martin Berman
openaire +1 more source
1990
Abstract In the last chapter I defined convex sets and quasi-concave and concave functions, and developed a geometric approach to constrained optimization based on the separation of two convex sets. This had the conceptual merit of suggesting a decentralized im-plementation of society’s economic optimization problem.
openaire +1 more source
Abstract In the last chapter I defined convex sets and quasi-concave and concave functions, and developed a geometric approach to constrained optimization based on the separation of two convex sets. This had the conceptual merit of suggesting a decentralized im-plementation of society’s economic optimization problem.
openaire +1 more source