Cone monotone mappings: Continuity and differentiability

We generalize some results of Borwein, Burke, Lewis, and Wang to mappings with values in metric (resp. ordered normed linear) spaces, and we define two classes of monotone mappings between an ordered linear space and a metric space (resp. ordered linear space): K$K$-monotone dominated and cone-to-cone monotone mappings. K$K$-monotone dominated mappings naturally generalize mappings with finite variation (in the classical sense) and K$K$-monotone functions defined by Borwein, Burke and Lewis to mappings with domains and ranges of higher dimensions. First, using results of Veselý and Zají?ek, we show some relationships between these classes. Then, we show that every K$K$-monotone function f:X→R$f:X\to \mathbb{R}$, where X$X$ is any Banach space, is continuous outside of a set which can be covered by countably many Lipschitz hypersurfaces. This sharpens a result due to Borwein and Wang. As a consequence, we obtain a similar result for K$K$-monotone dominated and cone-to-cone monotone mappings. Finally, we prove several results concerning almost everywhere differentiability (also in metric and w^∗$w^{\ast }$-senses) of these mappings.     

On the Continuity of the Tangent Cone to the Determinantal Variety

Set-Valued and Variational Analysis - Tangent and normal cones play an important role in constrained optimization to describe admissible search directions and, in particular, to formulate...     

连续同伦方法的点估计判据

本文证明了，当S·Smale［1］的点估计判据a（z0，f）＝||Df（z0）-1·f（z0）||sup||Df－1（z0）·时，求Banach空间解析映照f零点的连续同伦H（t，z）≡f（z）＋（t－1）f（z0）＝0有定义于［0，1］上的解z（t），且对t∈［0，1］，Hz（t，z（t））－1存在，进而F（Z（1））＝0，可以用连续同伦方法求得f的零点．     

New Results on Generalized $c$-Distance Without Continuity in Cone $b$-Metric Spaces over Banach Algebras

In this work, some new fixed point results for generalized Lipschitz mappings on generalized $c$-distance in cone $b$-metric spaces over Banach algebras are obtained, not acquiring the condition that the underlying cone should be normal or the mappings should be continuous. Furthermore, the existence and the uniqueness of the fixed point are proven for such mappings. These results greatly improve and generalize several well-known comparable results in the literature. Moreover, some examples and an application are given to support our new results.     

The Primal-Dual Second-Order Cone Approximations Algorithm for Symmetric Cone Programming

Given any open convex cone K, a logarithmically homogeneous, self-concordant barrier for K, and any positive real number r < 1, we associate, with each direction , a second-order cone containing K. We show that K is the interior of the intersection of the second-order cones , as x ranges over all directions in K. Using these second-order cones as approximations to cones of symmetric, positive definite matrices, we develop a new polynomial-time primal-dual interior-point algorithm for semidefinite programming. The algorithm is extended to symmetric cone programming via the relation between symmetric cones and Euclidean Jordan algebras.     

Primal Newton Method for the Linear Cone Programming Problem

A linear cone programming problem containing among the constraints a second-order cone is considered. For solving this problem, a primal Newton method which is constructed with the help of the optimality conditions is proposed. Local convergence of this method is proven.     

二次锥规划的光滑牛顿法

在光滑Fischer-Burmeister函数的基础上,本文给出了二次锥规划的一种新的光滑牛顿法.该方法所采用的系统不是等价于中心路径条件,而是等价于最优性条件本身.算法对初始点没有任何限制,且具有Q-二阶收敛速度.     

抽象锥中积分—微分方程的耦合拟解及单调迭代方法

本文利用微分方程、积分方程的耦合上、下拟解 ,借助于单调迭代法 ,讨论了非线性 Volterra型积分—微分方程的耦合极拟解问题     

Continuity of The Drazin inverse

Let A be an n×n matrix. It is shown that if a matrix  comes close to satisfying the definition of the Drazin inverse of A,A^D , then  is close to A^D .     

不具有关于锥的例外簇的映射

给出Hilbert空间到其自身不具有关于锥的例外族的映射条件，利用Hilbert空间可表为闭凸锥与负对偶锥的特点研究映射关于锥的例外簇的特性，证明了可通过映射在某紧凸子集上的性态判断其例外簇的存在与否，并讨论单调和沿射线单调映射的不具例外簇问题。     

Continuity of solutions to n-harmonic equations

In this paper, we study the nonhomogeneous n-harmonic equation $$-{\rm div}\,(|{\nabla} u|^{n-2}{\nabla} u)=f$$ in domains ${\Omega\subset {\mathbb {R}^n}}$ (n?≥?2), where ${f\in W^{-1,\frac{n}{n-1}}(\Omega)}$ . We derive a sharp condition to guarantee the continuity of solutions u. In particular, we show that when n?≥ 3, the condition that, for some ${\epsilon >0 ,}$ f belongs to $${\mathfrak{L}}({\rm log}\,{\mathfrak{L}})^{n-1}({\rm log}\,{\rm log}\,{\mathfrak{L}})^{n-2}\cdots({\rm log}\cdots{\rm log}\,{\mathfrak{L}})^{n-2}({\rm log}\cdots{\rm log}\,{\mathfrak{L}})^{n-2+\epsilon}(\Omega)$$ is sufficient for continuity of u, but not for ${\epsilon=0}$ .     

Reflection-Projection Method for Convex Feasibility Problems with an Obtuse Cone

The convex feasibility problem asks to find a point in the intersection of finitely many closed convex sets in Euclidean space. This problem is of fundamental importance in the mathematical and physical sciences, and it can be solved algorithmically by the classical method of cyclic projections.In this paper, the case where one of the constraints is an obtuse cone is considered. Because the nonnegative orthant as well as the set of positive-semidefinite symmetric matrices form obtuse cones, we cover a large and substantial class of feasibility problems. Motivated by numerical experiments, the method of reflection-projection is proposed: it modifies the method of cyclic projections in that it replaces the projection onto the obtuse cone by the corresponding reflection.This new method is not covered by the standard frameworks of projection algorithms because of the reflection. The main result states that the method does converge to a solution whenever the underlying convex feasibility problem is consistent. As prototypical applications, we discuss in detail the implementation of two-set feasibility problems aiming to find a nonnegative [resp. positive semidefinite] solution to linear constraints in ⁿ [resp. in , the space of symmetric n×n matrices] and we report on numerical experiments. The behavior of the method for two inconsistent constraints is analyzed as well.     

Cutting Angle Method and a Local Search

The paper deals with combinations of the cutting angle method in global optimization and a local search. We propose to use special transformed objective functions for each intermediate use of the cutting angle method. We report results of numerical experiments which demonstrate that the proposed approach is very beneficial in the search for a global minimum.     

The Limiting Normal Cone to Pointwise Defined Sets in Lebesgue Spaces

We consider subsets of Lebesgue spaces which are defined by pointwise constraints. We provide formulas for corresponding variational objects (tangent and normal cones). Our main result shows that the limiting normal cone is always dense in the Clarke normal cone and contains the convex hull of the pointwise limiting normal cone. A crucial assumption for this result is that the underlying measure is non-atomic, and this is satisfied in many important applications (Lebesgue measure on subsets of \(\mathbb {R}^{d}\) or the surface measure on hypersurfaces in \(\mathbb {R}^{d}\)). Finally, we apply our findings to an optimization problem with complementarity constraints in Lebesgue spaces.     

The Completeness of Cone Metric Spaces

Some topological properties of cone metric spaces are discussed and proved that every cone metric space （X, d） is complete if and only if every family of closed subsets of X which has the finite intersection property and which for every c ε E, 0 〈〈 c contains a set of diameter less that c has non-empty intersection.     

广义拟容量的C-右连续性

本文探讨广义容量的性质,得到如下结果：（a）具有C-右连续,即关于紧集连续的凸拟容量是凸容量;（b）一大类广义容量具有C-右连续性;（c）凸拟容量的准上积分是凸Choquet容量．此外,给出具有C-右连续性的弱拟容量的可容性定理．本文还利用上述结果研究调和空间上正超调和函数的缩减函数和扫除函数．     

无套利预算对应的连续性

当消费者的偏好是凸的 (不一定严格凸 )时 ,不完全市场的预算约束是价格单纯形与Grassman流形的乘积空间到商品空间的非线性集合值映射 ,简称为预算对应 .为了研究该模型的一般经济均衡的存在性 ,作者研究了无套利预算对应的性质 ,得到如下主要结果 :无套利预算对应是连续的 .     

The Strong Continuity of Convex Functions

A convex function defined on an open convex set of a finite-dimensional space is known to be continuous at every point of this set. In fact, a convex function has a strengthened continuity property. The notion of strong continuity is introduced in this study to show that a convex function has this property. The proof is based on only the definition of convexity and Jensen’s inequality. The definition of strong continuity involves a constant (the constant of strong continuity). An unimprovable value of this constant is given in the case of convex functions. The constant of strong continuity depends, in particular, on the form of a norm introduced in the space of arguments of a convex function. The polyhedral norm is of particular interest. It is straightforward to calculate the constant of strong continuity when it is used. This requires a finite number of values of the convex function.