首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 147 毫秒
1.
Given a point-to-set operator T, we introduce the operator T defined as T(x)= {u: u – v, x – y – for all y Rn, v T(y)}. When T is maximal monotone T inherits most properties of the -subdifferential, e.g. it is bounded on bounded sets, T(x) contains the image through T of a sufficiently small ball around x, etc. We prove these and other relevant properties of T, and apply it to generate an inexact proximal point method with generalized distances for variational inequalities, whose subproblems consist of solving problems of the form 0 H(x), while the subproblems of the exact method are of the form 0 H(x). If k is the coefficient used in the kth iteration and the k's are summable, then the sequence generated by the inexact algorithm is still convergent to a solution of the original problem. If the original operator is well behaved enough, then the solution set of each subproblem contains a ball around the exact solution, and so each subproblem can be finitely solved.  相似文献   

2.
We continue studying the mappings that are close to the harmonic mappings (-quasiharmonic mappings with small). This study originates with the previous articles of the author. The results of the article include a theorem on connection between the notion of -quasiharmonic mapping and the solutions to Beltrami systems, an analog to the arithmetic mean property of harmonic functions for -quasiharmonic mappings, a theorem on stability in the Poisson formula for harmonic mappings in the ball, and a theorem on the local smoothing of -quasiharmonic mappings with small which preserves proximity to the harmonic mappings.  相似文献   

3.
We consider the maximum function f resulting from a finite number of smooth functions. The logarithmic barrier function of the epigraph of f gives rise to a smooth approximation g of f itself, where >0 denotes the approximation parameter. The one-parametric family g converges – relative to a compact subset – uniformly to the function f as tends to zero. Under nondegeneracy assumptions we show that the stationary points of g and f correspond to each other, and that their respective Morse indices coincide. The latter correspondence is obtained by establishing smooth curves x() of stationary points for g , where each x() converges to the corresponding stationary point of f as tends to zero. In case of a strongly unique local minimizer, we show that the nondegeneracy assumption may be relaxed in order to obtain a smooth curve x().  相似文献   

4.
First, in joint work with S. Bodine of the University of Puget Sound, Tacoma, Washington, USA, we consider the second-order differential equation 2 y'=(1+2 (x, ))y with a small parameter , where is analytic and even with respect to . It is well known that it has two formal solutions of the form y±(x,)=e±x/h±(x,), where h±(x,) is a formal series in powers of whose coefficients are functions of x. It has been shown that one (resp. both) of these solutions are 1-summable in certain directions if satisfies certain conditions, in particular concerning its x-domain. We show that these conditions are essentially necessary for 1-summability of one (resp. both) of the above formal solutions. In the proof, we solve a certain inverse problem: constructing a differential equation corresponding to a certain Stokes phenomenon. The second part of the paper presents joint work with Augustin Fruchard of the University of La Rochelle, France, concerning inverse problems for the general (analytic) linear equations r y' = A(x,) y in the neighborhood of a nonturning point and for second-order (analytic) equations y' - 2xy'-g(x,) y=0 exhibiting resonance in the sense of Ackerberg-O'Malley, i.e., satisfying the Matkowsky condition: there exists a nontrivial formal solution such that the coefficients have no poles at x=0.  相似文献   

5.
We show that (a) the basic principles of subdifferential calculus (various local and global fuzzy principles, multidirectional mean value theorem, extremal principle) which are shown to be equivalent for -subdifferentials are in fact equivalent for any subdifferential and (b) for -versions of -subdifferentials these principles turn out to be also equivalent to the properties of the space to be a trustworthy or a subdifferentiability space (with respect to a given subdifferential).  相似文献   

6.
7.
Rovira  Carles  Tindel  Samy 《Potential Analysis》2001,14(4):409-435
We consider the family {X , 0} of solution to the heat equation on [0,T]×[0,1] perturbed by a small space-time white noise, that is t X = X +b({X })+({X }) . Then, for a large class of Borelian subsets of the continuous functions on [0,T]×[0,1], we get an asymptotic expansion of P({X }A) as 0. This kind of expansion has been handled for several stochastic systems, ranging from Wiener integrals to diffusion processes.  相似文献   

8.
We consider the method for constrained convex optimization in a Hilbert space, consisting of a step in the direction opposite to an k -subgradient of the objective at a current iterate, followed by an orthogonal projection onto the feasible set. The normalized stepsizes k are exogenously given, satisfying k=0 k = , k=0 k 2 < , and k is chosen so that k k for some > 0. We prove that the sequence generated in this way is weakly convergent to a minimizer if the problem has solutions, and is unbounded otherwise. Among the features of our convergence analysis, we mention that it covers the nonsmooth case, in the sense that we make no assumption of differentiability off, and much less of Lipschitz continuity of its gradient. Also, we prove weak convergence of the whole sequence, rather than just boundedness of the sequence and optimality of its weak accumulation points, thus improving over all previously known convergence results. We present also convergence rate results. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Research of this author was partially supported by CNPq grant nos. 301280/86 and 300734/95-6.  相似文献   

9.
A complete proof of the -maximum principle for discrete-time system is given. In proving the -maximum principle, the general linearization of the system equations about the optimum trajectory is avoided. Therefore, the requirements for the system equations are different from those of earlier works. It is shown that the -maximum principle under some mild conditions does approach the general discrete maximum principle and that the -maximum principle is always in a strong form. Thus, if is sufficiently small, the -problem can approximate the solution of the original problem and the difficulties inherent in abnormal problems can be avoided. It is also pointed out that the indeterminancy in the singular control problem can be avoided by using the -technique.This research was supported in part by AFOSR Grant No. AF-AFOSR-F44620-68-C-0023 and NSF Grant No. GK-5608.  相似文献   

10.
We consider a Ginzburg–Landau equation in the interval [–, ], >0, 1, with Neumann boundary conditions, perturbed by an additive white noise of strength We prove that if the initial datum is close to an "instanton" then, in the limit 0+, the solution stays close to some instanton for times that may grow as fast as any inverse power of , as long as the center of the instanton is far from the endpoints of the interval. We prove that the center of the instanton, suitably normalized, converges to a Brownian motion. Moreover, given any two initial data, each one close to an instanton, we construct a coupling of the corresponding processes so that in the limit 0+ the time of success of the coupling (suitably normalized) converges in law to the first encounter of two Brownian paths starting from the centers of the instantons that approximate the initial data.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号