Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming

In this paper we consider the linear symmetric cone programming (SCP). At a Karush-Kuhn-Tucker (KKT) point of SCP, we present the important conditions equivalent to the nonsingularity of Clarke’s generalized Jacobian of the KKT nonsmooth system, such as primal and dual constraint nondegeneracy, the strong regularity, and the nonsingularity of the B-subdifferential of the KKT system. This affirmatively answers an open question by Chan and Sun (SIAM J. Optim. 19:370–396, 2008).     

Superlinear Convergence of a Newton-Type Algorithm for Monotone Equations

We consider the problem of finding solutions of systems of monotone equations. The Newton-type algorithm proposed in Ref. 1 has a very nice global convergence property in that the whole sequence of iterates generated by this algorithm converges to a solution, if it exists. Superlinear convergence of this algorithm is obtained under a standard nonsingularity assumption. The nonsingularity condition implies that the problem has a unique solution; thus, for a problem with more than one solution, such a nonsingularity condition cannot hold. In this paper, we show that the superlinear convergence of this algorithm still holds under a local error-bound assumption that is weaker than the standard nonsingularity condition. The local error-bound condition may hold even for problems with nonunique solutions. As an application, we obtain a Newton algorithm with very nice global and superlinear convergence for the minimum norm solution of linear programs.This research was supported by the Singapore-MIT Alliance and the Australian Research Council.     

Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity

This paper deals with symmetric cone programming (SCP), which includes the linear programming (LP), the second-order cone programming (SOCP), the semidefinite programming (SDP) as special cases. Based on the Chen?CMangasarian smoothing function of the projection operator onto symmetric cones, we establish a smoothing Newton method for SCP. Global and quadratic convergence of the proposed algorithm is established under the primal and dual constraint nondegeneracies, but without the strict complementarity. Moreover, we show the equivalence at a Karush?CKuhn?CTucker (KKT) point among the primal and dual constraint nondegeneracies, the nonsingularity of the B-subdifferential of the smoothing counterpart of the KKT system, and the nonsingularity of the corresponding Clarke??s generalized Jacobian.     

Analysis of a smoothing Newton method for second-order cone complementarity problem

In this paper, we consider the second-order cone complementarity problem with P ₀-property. By introducing a smoothing parameter into the Fischer-Burmeister function, we present a smoothing Newton method for the second-order cone complementarity problem. The proposed algorithm solves only a linear system of equations and performs only one line search at each iteration. At the same time, the algorithm does not have restrictions on its starting point and has global convergence. Under the assumption of nonsingularity, we establish the locally quadratic convergence of the algorithm without strict complementarity condition. Preliminary numerical results show that the algorithm is promising.     

A smoothing Newton method for the second-order cone complementarity problem

In this paper we introduce a new smoothing function and show that it is coercive under suitable assumptions. Based on this new function, we propose a smoothing Newton method for solving the second-order cone complementarity problem (SOCCP). The proposed algorithm solves only one linear system of equations and performs only one line search at each iteration. It is shown that any accumulation point of the iteration sequence generated by the proposed algorithm is a solution to the SOCCP. Furthermore, we prove that the generated sequence is bounded if the solution set of the SOCCP is nonempty and bounded. Under the assumption of nonsingularity, we establish the local quadratic convergence of the algorithm without the strict complementarity condition. Numerical results indicate that the proposed algorithm is promising.     

Nonsingularity in second-order cone programming via the smoothing metric projector

Based on the differential properties of the smoothing metric projector onto the second-order cone,we prove that,for a locally optimal solution to a nonlinear second-order cone programming problem,the nonsingularity of the Clarke's generalized Jacobian of the smoothing Karush-Kuhn-Tucker system,constructed by the smoothing metric projector,is equivalent to the strong second-order sufficient condition and constraint nondegeneracy,which is in turn equivalent to the strong regularity of the Karush-Kuhn-Tucker p...     

Sub-quadratic convergence of a smoothing Newton method for second-order cone programming

In this paper, we present a smoothing Newton method for solving the second-order cone programming (SOCP) based on the Chen–Harker–Kanzow–Smale (CHKS) smoothing function. Our smoothing method reformulates SOCP as a nonlinear system of equations and then applies Newton’s method to the system. The proposed method solves only one linear system of equations and performs only one line search at each iteration. It is shown that the method is globally and locally sub-quadratically convergent under a nonsingularity assumption. Numerical results suggest that the method is promising.     

On a question of Gross

Using the notion of weighted sharing of sets we prove two uniqueness theorems which improve the results proved by Fang and Qiu [H. Qiu, M. Fang, A unicity theorem for meromorphic functions, Bull. Malaysian Math. Sci. Soc. 25 (2002) 31-38], Lahiri and Banerjee [I. Lahiri, A. Banerjee, Uniqueness of meromorphic functions with deficient poles, Kyungpook Math. J. 44 (2004) 575-584] and Yi and Lin [H.X. Yi, W.C. Lin, Uniqueness theorems concerning a question of Gross, Proc. Japan Acad. Ser. A 80 (2004) 136-140] and thus provide an answer to the question of Gross [F. Gross, Factorization of meromorphic functions and some open problems, in: Proc. Conf. Univ. Kentucky, Lexington, KY, 1976, in: Lecture Notes in Math., vol. 599, Springer, Berlin, 1977, pp. 51-69], under a weaker hypothesis.     

Uniqueness of meromorphic functions concerning fixed points

In this paper, we discuss the uniqueness of meromorphic functions concerning fixed points. In view of the fixed points, we extend a recent conclusion due to Zhang and Lin. Moreover, under the condition of f and g sharing ∞ IM, our theorem generalizes some previous results of Fang and Qiu, Lin and Yi and so on.     

Uniqueness and value-sharing of differential polynomials of meromorphic functions

In this paper, we investigate uniqueness problems of meromorphic functions concerning differential polynomials sharing non-zero finite value and give some results. As particular cases of our results we deduce some significant results which improve several earlier results of Fang and Hong (2001) [2], Yang and Yi (2003) [7], Lin and Yi (2004) [5] and others.     

INTERPOLATION INEQUALITIES AND DECAY ESTIMATES FOR DERIVATIVES

Under the only assumption of the cone property for a given domain Rn, it is proved that inter polation inequalities for intermediate derivatives of functions in the Sobolev spaces Wm,p or even in some weighted Sobolve spaces still hold. That is, the usual additional restrictions that is bounded or has the uniform cone property are both removed. The main tools used are polynomial inequalities, by which it is also ob- tained pointwise version inter polation inequalities for smooth and analytic functions. Such pointwise version in - equalities give explicit decay estimates for derivatives at infinity in unbounded domains which have the cone property. As an application of the decay ertimates, a previous result on radial basis function approximation of smooth functions is extended to the derivative-simultaneous approximation.     

Nonsingularity in matrix conic optimization induced by spectral norm via a smoothing metric projector

Matrix conic optimization induced by spectral norm (MOSN) has found important applications in many fields. This paper focus on the optimality conditions and perturbation analysis of the MOSN problem. The Karush–Kuhn–Tucker (KKT) conditions of the MOSN problem can be reformulated as a nonsmooth system via the metric projector over the cone. We show in this paper, the nonsingularity of the Clarke’s generalized Jacobian of the smoothing KKT system constructed by a smoothing metric projector, the strong regularity and the strong second-order sufficient condition under constraint nondegeneracy are all equivalent. Moreover, this nonsingularity is used in several globally convergent smoothing Newton methods.     

Dependence of Kazhdan constants on generating subsets

In this paper we answer a question of A. Lubotzky by giving examples of groups having property (T) without uniform Kazhdan constants. We show that many lattices in Lie groups do not admit a Kazhdan constant which is independent of the generating subset.     

Minimization of integral functionals depending on lipschitz domains

In this paper is solved a minimization problem for what is essentially an integral functional depending on domains which verify an uniform cone property with a fixed parameter θ by extending the techniques land results of O. Caligaris and P. Oliva ‘1’ for convex sets. A Dirichlet condition and an obstacle are considered.     

LINEAR ORDERS ON RINGS

The general ideas introduced in Radeleczki and Szigeti (2004) are adapted to investigate quasi cones and cones of rings. Using the finite extension property for cones, we answer the question concerning when a compatible partial order of a ring has a compatible linear extension (equivalently, when the positive cone of this order is contained in a full cone). It turns out that, if there is no such extension, then it is caused by a finite system of polynomial-like equations satisfied by some elements of a certain finite subset of the ring and some positive elements.     

角域内亚纯函数的唯一性定理

该文研究了复平面上的亚纯函数在角域内分担两个集合的唯一性,将仪洪勋和林伟川最近得到的复平面上的亚纯函数在全平面上分担两个集合的唯一性定理中的在全平面上分担两个集合的条件改成在角域内分担两个集合,得到了几个唯一性定理.     

Unconstrained optimization reformulation of the generalized nonlinear complementarity problem and related method

In this article, we first propose an unconstrained optimization reformulation of the generalized nonlinear complementarity problem (GNCP) over a polyhedral cone, and then discuss the conditions under which its any stationary point is a solution of the GNCP. The conditions which guarantee the nonsingularity and positive definiteness of the Hessian matrix of the objective function are also given. In the end, we design a Newton-type method to solve the GNCP and show the global and local quadratic convergence of the proposed method under certain assumptions.     

A regularized strong duality for nonsymmetric semidefinite least squares problem

The nonsymmetric semidefinite least squares problem (NSDLS) is to find a nonsymmetric semidefinite matrix which is closest to a given matrix in Frobenius norm. It is an extension of the semidefinite least squares problem (SDLS) and has important application in the area of robotics and automation. In this note, by developing the minimal representation of the underlying cone with the linear constraints, we obtain a regularized strong duality with low-dimensional projection for NSDLS. Further, we study the generalized differential properties and nonsingularity of the first order optimality system about the dual problem. These theoretical results demonstrate that we can solve NSDLS as good as the current Lagrangian dual approaches to SDLS.     

直径为5的整树

“整图”这个术语首先由 F.Harary 和 A.J.Schwenk(1974)引入.所谓整图就是指其特征值均为整数的图.文献[1]给出了所有直径小于4的整树以及一类直径4的整树.文献[2]给出了无穷多个异于文献[1]所指出的直径4的整树,并找到了无穷多个直径6的整树,同时提出下面两个未解决的问题:存在直径5的整树吗?存在直径任意大的整树吗?     

A sharp bound on the Hausdorff dimension of the singular set of a uniform measure

The study of the geometry of n-uniform measures in \(\mathbb {R}^{d}\) has been an important question in many fields of analysis since Preiss’ seminal proof of the rectifiability of measures with positive and finite density. The classification of uniform measures remains an open question to this day. In fact there is only one known example of a non-trivial uniform measure, namely 3-Hausdorff measure restricted to the Kowalski–Preiss cone. Using this cone one can construct an n-uniform measure whose singular set has Hausdorff dimension \(n-3\). In this paper, we prove that this is the largest the singular set can be. Namely, the Hausdorff dimension of the singular set of any n-uniform measure is at most \(n-3\).