Displaying 161 – 180 of 686

Showing per page

On minimizing noncoercive functionals on weakly vlosed sets

Vy Le, Klaus Schmitt (1996)

Banach Center Publications

We consider noncoercive functionals on a reflexive Banach space and establish minimization theorems for such functionals on smooth constraint manifolds. The functionals considered belong to a class which includes semi-coercive, compact-coercive and P-coercive functionals. Some applications to nonlinear partial differential equations are given.

On near-optimal necessary and sufficient conditions for forward-backward stochastic systems with jumps, with applications to finance

Mokhtar Hafayed, Petr Veverka, Syed Abbas (2014)

Applications of Mathematics

We establish necessary and sufficient conditions of near-optimality for nonlinear systems governed by forward-backward stochastic differential equations with controlled jump processes (FBSDEJs in short). The set of controls under consideration is necessarily convex. The proof of our result is based on Ekeland's variational principle and continuity in some sense of the state and adjoint processes with respect to the control variable. We prove that under an additional hypothesis, the near-maximum...

On necessary optimality conditions in a class of optimization problems

Jiří V. Outrata (1989)

Aplikace matematiky

In the paper necessary optimality conditions are derived for the minimization of a locally Lipschitz objective with respect to the consttraints x S , 0 F ( x ) , where S is a closed set and F is a set-valued map. No convexity requirements are imposed on F . The conditions are applied to a generalized mathematical programming problem and to an abstract finite-dimensional optimal control problem.

On noncooperative nonlinear differential games

Tomáš Roubíček (1999)

Kybernetika

Noncooperative games with systems governed by nonlinear differential equations remain, in general, nonconvex even if continuously extended (i. e. relaxed) in terms of Young measures. However, if the individual payoff functionals are “enough” uniformly convex and the controlled system is only “slightly” nonlinear, then the relaxed game enjoys a globally convex structure, which guarantees existence of its Nash equilibria as well as existence of approximate Nash equilibria (in a suitable sense) for...

On nonhomogeneous reinforcements of varying shape and different exponents

Mohamed Boutkrida, Jacqueline Mossino, Gonoko Moussa (1999)

Bollettino dell'Unione Matematica Italiana

Studiamo un problema ellittico quasilineare concernente un dominio circondato da un rinforzo sottile di spessore variabile, in cui il coefficiente dell'equazione è (localmente) non costante. Esso concerne due diversi esponenti, uno nel dominio e l'altro nel rinforzo, una condizione di Dirichlelet sulla frontiera esterna e una condizione di trasmissione. Prediciamo il comportamento asintotico della soluzione quando lo spessore, insieme con il coefficiente nel rinforzo, tende a zero perché essi siano...

On nonlinear, nonconvex evolution inclusions

Nikolaos S. Papageorgiou (1995)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

We consider a nonlinear evolution inclusion driven by an m-accretive operator which generates an equicontinuous nonlinear semigroup of contractions. We establish the existence of extremal integral solutions and we show that they form a dense, G δ -subset of the solution set of the original Cauchy problem. As an application, we obtain “bang-bang”’ type theorems for two nonlinear parabolic distributed parameter control systems.

On optimal matching measures for matching problems related to the Euclidean distance

José Manuel Mazón, Julio Daniel Rossi, Julián Toledo (2014)

Mathematica Bohemica

We deal with an optimal matching problem, that is, we want to transport two measures to a given place (the target set) where they will match, minimizing the total transport cost that in our case is given by the sum of two different multiples of the Euclidean distance that each measure is transported. We show that such a problem has a solution with an optimal matching measure supported in the target set. This result can be proved by an approximation procedure using a p -Laplacian system. We prove...

Currently displaying 161 – 180 of 686