首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let X be a Banach space. We say that X satisfies the fixed point property (weak fixed point property) if every non-expansive mapping defined from a convex closed bounded (convex weakly compact) subset of X into itself has a fixed point. We say that X satisfies the stable fixed point property (stable weak fixed point property) if the same is true for every equivalent norm which is close enough to the original one. Denote by P(X) the set formed by all equivalent norms with the topology of the uniform convergence on the unit ball of X. We prove that the subset of P(X) formed by the norms failing the fixed point property is dense in P(X) when X is a non-distortable space which fails the fixed point property. In particular, no renorming of ?1 can satisfy the stable fixed point property. Furthermore, we show some examples of distortable spaces failing the weak fixed point property, which can be renormed to satisfy the stable weak fixed point property. As a consequence we prove that every separable Banach space can be renormed to satisfy the stable weak fixed point property.  相似文献   

2.
Simulated annealing for constrained global optimization   总被引:10,自引:0,他引:10  
Hide-and-Seek is a powerful yet simple and easily implemented continuous simulated annealing algorithm for finding the maximum of a continuous function over an arbitrary closed, bounded and full-dimensional body. The function may be nondifferentiable and the feasible region may be nonconvex or even disconnected. The algorithm begins with any feasible interior point. In each iteration it generates a candidate successor point by generating a uniformly distributed point along a direction chosen at random from the current iteration point. In contrast to the discrete case, a single step of this algorithm may generateany point in the feasible region as a candidate point. The candidate point is then accepted as the next iteration point according to the Metropolis criterion parametrized by anadaptive cooling schedule. Again in contrast to discrete simulated annealing, the sequence of iteration points converges in probability to a global optimum regardless of how rapidly the temperatures converge to zero. Empirical comparisons with other algorithms suggest competitive performance by Hide-and-Seek.This material is based on work supported by a NATO Collaborative Research Grant, no. 0119/89.  相似文献   

3.
It was once conjectured that if A is a uniform algebra on its maximal ideal space X, and if each point of X is a peak point for A, then A = C(X). This peak point conjecture was disproved by Brian Cole in 1968. However, Anderson and Izzo showed that the peak point conjecture does hold for uniform algebras generated by smooth functions on smooth two-manifolds with boundary. The corresponding assertion for smooth three-manifolds is false, but Anderson, Izzo, and Wermer established a peak point theorem for polynomial approximation on real-analytic three-manifolds with boundary. Here we establish a more general peak point theorem for real-analytic three-manifolds with boundary analogous to the two-dimensional result. We also show that if A is a counterexample to the peak point conjecture generated by smooth functions on a manifold of arbitrary dimension, then the essential set for A has empty interior.  相似文献   

4.
We define a cobordism theory in algebraic geometry based on normal crossing degenerations with double point singularities. The main result is the equivalence of double point cobordism to the theory of algebraic cobordism previously defined by Levine and Morel. Double point cobordism provides a simple, geometric presentation of algebraic cobordism theory. As a corollary, the Lazard ring given by products of projective spaces rationally generates all nonsingular projective varieties modulo double point degenerations. Double point degenerations arise naturally in relative Donaldson–Thomas theory. We use double point cobordism to prove all the degree 0 conjectures in Donaldson–Thomas theory: absolute, relative, and equivariant.  相似文献   

5.
On an Extended Lagrange Claim   总被引:1,自引:0,他引:1  
Lagrange once made a claim having the consequence that a smooth function f has a local minimum at a point if all the directional derivatives of f at that point are nonnegative. That the Lagrange claim is wrong was shown by a counterexample given by Peano. In this note, we show that an extended claim of Lagrange is right. We show that, if all the lower directional derivatives of a locally Lipschitz function f at a point are positive, then f has a strict minimum at that point.  相似文献   

6.
Inspired by locale theory, we propose “pointfree convex geometry”. We introduce the notion of convexity algebra as a pointfree convexity space. There are two notions of a point for convexity algebra: one is a chain-prime meet-complete filter and the other is a maximal meet-complete filter. In this paper we show the following: (1) the former notion of a point induces a dual equivalence between the category of “spatial” convexity algebras and the category of “sober” convexity spaces as well as a dual adjunction between the category of convexity algebras and the category of convexity spaces; (2) the latter notion of point induces a dual equivalence between the category of “m-spatial” convexity algebras and the category of “m-sober” convexity spaces. We finally argue that the former notion of a point is more useful than the latter one from a category theoretic point of view and that the former notion of a point actually represents a polytope (or generic point) and the latter notion of a point properly represents a point. We also remark on the close relationships between pointfree convex geometry and domain theory.  相似文献   

7.
We describe the Weierstrass semigroup of a Galois Weierstrass point with prime degree and the Weierstrass semigroup of a pair of Galois Weierstrass points with prime degree, where a Galois Weierstrass point with degree n means a total ramification point of a cyclic covering of the projective line of degree n.*Supported by Korea Research Foundation Grant (KRF-2003-041-C20010).**Partially supported by Grant-in-Aid for Scientific Research (15540051), JSPS.  相似文献   

8.
The level set of an elliptic function is a doubly periodic point set in ℂ. To obtain a wider spectrum of point sets, we consider, more generally, a Riemann surface S immersed in ℂ2 and its sections (“cuts”) by ℂ More specifically, we consider surfaces S defined in terms of a fundamental surface element obtained as a conformai map of triangular domains in ℂ. The discrete group of isometries of ℂ2 generated by reflections in the triangle edges leaves S invariant and generalizes double-periodicity. Our main result concerns the special case of maps of right triangles, with the right angle being a regular point of the map. For this class of maps we show that only seven Riemann surfaces, when cut, form point sets that are discrete in ℂ. Their isometry groups all have a rank 4 lattice subgroup, but only three of the corresponding point sets are doubly periodic in ℂ. The remaining surfaces form quasiperiodic point sets closely related to the vertex sets of quasiperiodic tilings. In fact, vertex sets of familiar tilings are recovered in all cases by applying the construction to a piecewise flat approximation of the corresponding Riemann surface. The geometry of point sets formed by cuts of Riemann surfaces is no less “rigid” than the geometry determined by a tiling, and has the distinct advantage in having a regular behavior with respect to the complex parameter which specifies the cut.  相似文献   

9.
To solve linear programming problems by interior point methods an approximately centered interior point has to be known. Such a point can be found by an algorithmic approach – a so-called phase 1 algorithm or centering algorithm. For random linear programming problems distributed according to the rotation symmetry model, especially with normal distribution, we present probabilistic results on the quality of the origin as starting point and the average number of steps of a centering algorithm.  相似文献   

10.
The point process corresponding to the configurations of bosons in standard conditions is a Cox process driven by the square norm of a centered Gaussian process. This point process is infinitely divisible. We point out the fact that this property is preserved by the Bose–Einstein condensation phenomenon and show that the obtained point process after such a condensation occured, is still a Cox process but driven by the square norm of a shifted Gaussian process, the shift depending on the density of the particles. This law provides an illustration of a “super”- Isomorphism Theorem existing above the usual Isomorphism Theorem of Dynkin available for Gaussian processes. Submitted: February 8, 2008. Accepted: March 5, 2008.  相似文献   

11.
Nadler’s contraction principle has led to fixed point theory of set-valued contraction in non-linear analysis. Inspired by the results of Nadler, the fixed point theory of set-valued contraction has been further developed in different directions by many authors, in particular, by Reich, Mizoguchi–Takahashi, Feng–Liu and many others. In the present paper, the concept of generalized contractions for set-valued maps in metric spaces is introduced and the existence of fixed point for such a contraction are guaranteed by certain conditions. Our first result extends and generalizes the Nadler, Feng–Liu and Klim–Wardowski theorems and the second result is different from the Reich and Mizoguchi–Takahashi results. As a consequence, we derive some results related to fixed point of set-valued maps satisfying certain conditions of integral type.  相似文献   

12.
We utilize the Lie-Tressé linearization method to obtain linearizing point transformations of certain autonomous nonlinear second-order ordinary differential equations contained in the Painlevé-Gambier classification. These point transformations are constructed using the Lie point symmetry generators admitted by the underlying Painlevé-Gambier equations. It is also shown that those Painlevé-Gambier equations which have a few Lie point symmetries and hence are not linearizable by this method can be integrated by a quadrature. Moreover, by making use of the partial Lagrangian approach we obtain time dependent and time independent first integrals for these Painlevé-Gambier equations which have not been reported in the earlier literature. A comparison of the results obtained in this paper is made with the ones obtained using the generalized Sundman linearization method.  相似文献   

13.
Every closed and non-empty subset of a compact surfaceS can be the fixed point set of a homeomorphism, andS also admits fixed point free homeomorphisms if it does not have the fixed point property. A partial extension to higher dimensions states that every closed and non-empty subset of a compactn-manifold can be the fixed point set of a surjective self-map. This research was partially supported by the National Research Council of Canada (Grant A 7579).  相似文献   

14.
We study the accumulation of an elliptic fixed point of a real analytic Hamiltonian by quasi-periodic invariant tori. We show that a fixed point with Diophantine frequency vector ω 0 is always accumulated by invariant complex analytic KAM-tori. Indeed, the following alternative holds: If the Birkhoff normal form of the Hamiltonian at the invariant point satisfies a Rüssmann transversality condition, the fixed point is accumulated by real analytic KAM-tori which cover positive Lebesgue measure in the phase space (in this part it suffices to assume that ω 0 has rationally independent coordinates). If the Birkhoff normal form is degenerate, there exists an analytic subvariety of complex dimension at least d + 1 passing through 0 that is foliated by complex analytic KAM-tori with frequency ω 0. This is an extension of previous results obtained in [1] to the case of an elliptic fixed point.  相似文献   

15.
Interior–point algorithms are among the most efficient techniques for solving complementarity problems. In this paper, a procedure for globalizing interior–point algorithms by using the maximum stepsize is introduced. The algorithm combines exact or inexact interior–point and projected–gradient search techniques and employs a line–search procedure for the natural merit function associated with the complementarity problem. For linear problems, the maximum stepsize is shown to be acceptable if the Newton interior–point search direction is employed. Complementarity and optimization problems are discussed, for which the algorithm is able to process by either finding a solution or showing that no solution exists. A modification of the algorithm for dealing with infeasible linear complementarity problems is introduced which, in practice, employs only interior–point search directions. Computational experiments on the solution of complementarity problems and convex programming problems by the new algorithm are included.  相似文献   

16.
We propose two line search primal-dual interior-point methods for nonlinear programming that approximately solve a sequence of equality constrained barrier subproblems. To solve each subproblem, our methods apply a modified Newton method and use an 2-exact penalty function to attain feasibility. Our methods have strong global convergence properties under standard assumptions. Specifically, if the penalty parameter remains bounded, any limit point of the iterate sequence is either a Karush-Kuhn-Tucker (KKT) point of the barrier subproblem, or a Fritz-John (FJ) point of the original problem that fails to satisfy the Mangasarian-Fromovitz constraint qualification (MFCQ); if the penalty parameter tends to infinity, there is a limit point that is either an infeasible FJ point of the inequality constrained feasibility problem (an infeasible stationary point of the infeasibility measure if slack variables are added) or a FJ point of the original problem at which the MFCQ fails to hold. Numerical results are given that illustrate these outcomes. Research supported by the Presidential Fellowship of Columbia University. Research supported in part by NSF Grant DMS 01-04282, DOE Grant DE-FG02-92EQ25126 and DNR Grant N00014-03-0514.  相似文献   

17.
On algebraic K-theory of a finite-dimensional semisimple real algebra the involution induced by an antistructure is studied. After Bousfield–Kan completion at 2, a component of the homotopy fixed point set is homotopy-equivalent to the fixed point set. The fixed point set is calculated.  相似文献   

18.
Given any Lax shock of the compressible Euler dynamics equations, we show that there exists the corresponding traveling wave of the system when viscosity and capillarity are suitably added. For a traveling wave corresponding to a given Lax shock, the governing viscous–capillary system is reduced to a system of two differential equations of first-order, which admits an asymptotically stable equilibrium point and a saddle point. We then develop the method of estimating attraction domain of the asymptotically stable equilibrium point for the compressible Euler equations and show that the saddle point in fact lies on the boundary of this set. Then, we establish a saddle-to-stable connection by pointing out that there is a stable trajectory leaving the saddle point and entering the attraction domain of the asymptotically stable equilibrium point. This gives us a traveling wave of the viscous–capillary compressible Euler equations.  相似文献   

19.
20.
Here we show that there exists a greatest fixed point separating congruence denoted by Ψ on a double MS-algebra (L;0, +). Some properties of Ψ under certain conditions on fixed point complete and fixed point distributive have also been described. An aid research grant from the State Education Commission of China is gratefully acknowledged  相似文献   

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

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