By using the theory of Euclidean Jordan algebras,based on a new class of smoothing functions,the QiSun-Zhou's smoothing Newton algorithm is extended to solve linear programming over symmetric cones(SCLP).The algor...By using the theory of Euclidean Jordan algebras,based on a new class of smoothing functions,the QiSun-Zhou's smoothing Newton algorithm is extended to solve linear programming over symmetric cones(SCLP).The algorithm is globally convergent under suitable assumptions.展开更多
Given a real finite-dimensional or infinite-dimensional Hilbert space H with a Jordan product, the second-order cone linear complementarity problem(SOCLCP)is considered. Some conditions are investigated, for which the...Given a real finite-dimensional or infinite-dimensional Hilbert space H with a Jordan product, the second-order cone linear complementarity problem(SOCLCP)is considered. Some conditions are investigated, for which the SOCLCP is feasible and solvable for any element q?H. The solution set of a monotone SOCLCP is also characterized. It is shown that the second-order cone and Jordan product are interconnected.展开更多
The paper uses Euclidean Jordan algebras as a basic tool to extend smoothing functions, which include the Chen-Mangasarian class and the Fischer-Burmeister smoothing functions, to symmetric cone complementarity proble...The paper uses Euclidean Jordan algebras as a basic tool to extend smoothing functions, which include the Chen-Mangasarian class and the Fischer-Burmeister smoothing functions, to symmetric cone complementarity problems. Computable formulas for these functions and their Jacobians are derived. In addition, it is shown that these functions are Lipschitz continuous with respect to parameter # and continuously differentiable on J × J for any μ 〉 0.展开更多
In this paper, we introduce a new class of two-parametric penalized function,which includes the penalized minimum function and the penalized Fischer-Burmeister function over symmetric cone complementarity problems. We...In this paper, we introduce a new class of two-parametric penalized function,which includes the penalized minimum function and the penalized Fischer-Burmeister function over symmetric cone complementarity problems. We propose that this class of function is a class of complementarity functions(C-function). Moreover, its merit function has bounded level set under a weak condition.展开更多
We consider maps on positive definite cones of von Neumann algebras preserving unitarily invariant norms of the spectral geometric means. The main results concern Jordan *-isomorphisms between <em>C</em>*-...We consider maps on positive definite cones of von Neumann algebras preserving unitarily invariant norms of the spectral geometric means. The main results concern Jordan *-isomorphisms between <em>C</em>*-algebras, and show that they are characterized by the preservation of unitarily invariant norms of those operations.展开更多
We establish polynomial complexity bounds of the Mehrotra-type predictorcorrector algorithms for linear programming over symmetric cones. We first slightly modify the maximum step size in the predictor step of the saf...We establish polynomial complexity bounds of the Mehrotra-type predictorcorrector algorithms for linear programming over symmetric cones. We first slightly modify the maximum step size in the predictor step of the safeguard based Mehrotra-type algorithm for linear programming, that was proposed by Salahi et al[18]. Then, using the machinery of Euclidean Jordan algebras, we extend the modified algorithm to symmetric cones. Based on the Nesterov-Todd direction, we obtain O(r log ε-1) iteration complexity bound of this algorithm, where r is the rank of the Jordan algebras and ε is the required precision. We also present a new variant of Mehrotra-type algorithm using a new adaptive updating scheme of centering parameter and show that this algorithm enjoys the same order of complexity bound as the safeguard algorithm. We illustrate the numerical behaviour of the methods on some small examples.展开更多
Given a real(finite-dimensional or infinite-dimensional) Hilbert space H with a Jordan product,we consider the Lorentz cone linear complementarity problem,denoted by LCP(T,Ω,q),where T is a continuous linear operator...Given a real(finite-dimensional or infinite-dimensional) Hilbert space H with a Jordan product,we consider the Lorentz cone linear complementarity problem,denoted by LCP(T,Ω,q),where T is a continuous linear operator on H,ΩH is a Lorentz cone,and q ∈ H.We investigate some conditions for which the problem concerned has a unique solution for all q ∈ H(i.e.,T has the GUS-property).Several sufficient conditions and several necessary conditions are given.In particular,we provide two suficient and necessary conditions of T having the GUS-property.Our approach is based on properties of the Jordan product and the technique from functional analysis,which is different from the pioneer works given by Gowda and Sznajder(2007) in the case of finite-dimensional spaces.展开更多
In this paper, we propose a smoothing algorithm for solving the monotone symmetric cone complementarity problems (SCCP for short) with a nonmonotone line search. We show that the nonmonotone algorithm is globally conv...In this paper, we propose a smoothing algorithm for solving the monotone symmetric cone complementarity problems (SCCP for short) with a nonmonotone line search. We show that the nonmonotone algorithm is globally convergent under an assumption that the solution set of the problem concerned is nonempty. Such an assumption is weaker than those given in most existing algorithms for solving optimization problems over symmetric cones. We also prove that the solution obtained by the algorithm is a maximally complementary solution to the monotone SCCP under some assumptions.展开更多
基金Supported by Liu Hui Centre for Applied Mathematics,Nankai University and Tianjin University
文摘By using the theory of Euclidean Jordan algebras,based on a new class of smoothing functions,the QiSun-Zhou's smoothing Newton algorithm is extended to solve linear programming over symmetric cones(SCLP).The algorithm is globally convergent under suitable assumptions.
基金Supported by the National Natural Science Foundation of China(No.11101302 and No.11471241)
文摘Given a real finite-dimensional or infinite-dimensional Hilbert space H with a Jordan product, the second-order cone linear complementarity problem(SOCLCP)is considered. Some conditions are investigated, for which the SOCLCP is feasible and solvable for any element q?H. The solution set of a monotone SOCLCP is also characterized. It is shown that the second-order cone and Jordan product are interconnected.
基金Supported by the Funds of Ministry of Education of China for PhD (20020141013)the NNSF of China (10471015).
文摘The paper uses Euclidean Jordan algebras as a basic tool to extend smoothing functions, which include the Chen-Mangasarian class and the Fischer-Burmeister smoothing functions, to symmetric cone complementarity problems. Computable formulas for these functions and their Jacobians are derived. In addition, it is shown that these functions are Lipschitz continuous with respect to parameter # and continuously differentiable on J × J for any μ 〉 0.
文摘In this paper, we introduce a new class of two-parametric penalized function,which includes the penalized minimum function and the penalized Fischer-Burmeister function over symmetric cone complementarity problems. We propose that this class of function is a class of complementarity functions(C-function). Moreover, its merit function has bounded level set under a weak condition.
文摘We consider maps on positive definite cones of von Neumann algebras preserving unitarily invariant norms of the spectral geometric means. The main results concern Jordan *-isomorphisms between <em>C</em>*-algebras, and show that they are characterized by the preservation of unitarily invariant norms of those operations.
基金Supported by the National Natural Science Foundation of China(11471102,61301229)Supported by the Natural Science Foundation of Henan University of Science and Technology(2014QN039)
文摘We establish polynomial complexity bounds of the Mehrotra-type predictorcorrector algorithms for linear programming over symmetric cones. We first slightly modify the maximum step size in the predictor step of the safeguard based Mehrotra-type algorithm for linear programming, that was proposed by Salahi et al[18]. Then, using the machinery of Euclidean Jordan algebras, we extend the modified algorithm to symmetric cones. Based on the Nesterov-Todd direction, we obtain O(r log ε-1) iteration complexity bound of this algorithm, where r is the rank of the Jordan algebras and ε is the required precision. We also present a new variant of Mehrotra-type algorithm using a new adaptive updating scheme of centering parameter and show that this algorithm enjoys the same order of complexity bound as the safeguard algorithm. We illustrate the numerical behaviour of the methods on some small examples.
基金supported by National Natural Science Foundation of China(Grant No. 10871144)the Natural Science Foundation of Tianjin Province (Grant No. 07JCYBJC05200)
文摘Given a real(finite-dimensional or infinite-dimensional) Hilbert space H with a Jordan product,we consider the Lorentz cone linear complementarity problem,denoted by LCP(T,Ω,q),where T is a continuous linear operator on H,ΩH is a Lorentz cone,and q ∈ H.We investigate some conditions for which the problem concerned has a unique solution for all q ∈ H(i.e.,T has the GUS-property).Several sufficient conditions and several necessary conditions are given.In particular,we provide two suficient and necessary conditions of T having the GUS-property.Our approach is based on properties of the Jordan product and the technique from functional analysis,which is different from the pioneer works given by Gowda and Sznajder(2007) in the case of finite-dimensional spaces.
基金supported by National Natural Science Foundation of China (Grant Nos. 10571134, 10671010)Natural Science Foundation of Tianjin (Grant No. 07JCYBJC05200)
文摘In this paper, we propose a smoothing algorithm for solving the monotone symmetric cone complementarity problems (SCCP for short) with a nonmonotone line search. We show that the nonmonotone algorithm is globally convergent under an assumption that the solution set of the problem concerned is nonempty. Such an assumption is weaker than those given in most existing algorithms for solving optimization problems over symmetric cones. We also prove that the solution obtained by the algorithm is a maximally complementary solution to the monotone SCCP under some assumptions.