Results 281 to 290 of about 13,736,700 (344)

Convex Minimization Problems

2017
Convex optimization is one of the main areas of application of convex analysis. This chapter deals with the issues of existence and uniqueness in minimization problems and investigates properties of minimizing sequences.
Heinz H. Bauschke, Patrick L. Combettes
openaire   +1 more source

Minimal NFA problems are hard

SIAM Journal on Computing, 1991
Summary: Finite automata (FA's) are of fundamental importance in theory and in applications. The following basic minimization problem is studied: Given a DFA (deterministic FA), find a minimum equivalent nondeterministic FA (NFA). This paper shows that the natural decision problem associated with it is PSPACE-complete.
Jiang, Tao, Ravikumar, B.
openaire   +2 more sources

Minimal Templates Problem

2007
In a 1976 Dempster and Shafer have created a mathematical theory of evidence called Dempster-Shafer theory. This theory is based on belief functions and plausible reasoning, which is used to combine separate pieces of information (evidence) to calculate the probability of an event.
Barbara Marszał-Paszek, Piotr Paszek
openaire   +1 more source

The calibration method for the Mumford-Shah functional and free-discontinuity problems

, 1999
. We present a minimality criterion for the Mumford-Shah functional, and more generally for non convex variational integrals on SBV which couple a surface and a bulk term. This method provides short and easy proofs for several minimality results.
G. Alberti, G. Bouchitté, G. Dal Maso
semanticscholar   +1 more source

SOME PROBLEMS CONCERNING MINIMAL NETWORKS

International Journal of Shape Modeling, 1994
Summary: We study the geometry of minimal networks on some Riemannian manifolds (each small part of such a network has the smallest possible length). We discuss a complete classification of planar minimal networks spanning convex boundary sets, some results concerning the investigation of minimal networks spanning the vertex set of a regular polygon ...
Ivanov, A. O., Tuzhilin, A. A.
openaire   +2 more sources

Minimizers for the Kepler Problem

Qualitative Theory of Dynamical Systems, 2020
The author characterizes the minimizing geodesics for the Kepler problem endowed with the Jacobi-Maupertuis metric, in all the cases. Jacobi stated without proof in 1836 a condition under which the Keplerian elliptic orbit is the minimizer. A proof was given in 1871 by I.
openaire   +2 more sources

An area‐Dirichlet integral minimization problem

Communications on Pure and Applied Mathematics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
I. Athanasopoulos, L. Caffarelli, C. Kenig, SALSA, SANDRO   +3 more
openaire   +3 more sources

Minimizing behavioral problems

Business Horizons, 1972
When a firm's activities become international in scope, changes occur. Some of the changes tend to be along predictable lines. More uncertain is the behavioral performance of the firm's executives as they cross cultural and national boundaries. The author isolates three areas of behavioral difficulty that are particularly important: culture shock, self-
openaire   +1 more source

Primality, criticality and minimality problems in trees

Discret. Math. Algorithms Appl., 2022
Walid Marweni
semanticscholar   +1 more source

On Newton’s problem of minimal resistance

The Mathematical Intelligencer, 1993
In 1685, Sir Isaac Newton studied the motion of bodies through an inviscid and incompressible medium. In his words (from his Principia Mathematica): If in a rare medium, consisting of equal particles freely disposed at equal distances from each other, a globe and a cylinder described on equal diameter move with equal velocities in the direction of ...
Buttazzo, Giuseppe, Kawohl, Bernhard
openaire   +2 more sources