In this paper, we present a large-update primal-dual interior-point method for symmetric cone optimization（SCO） based on a new kernel function, which determines both search directions and the proximity measure betwe...In this paper, we present a large-update primal-dual interior-point method for symmetric cone optimization（SCO） based on a new kernel function, which determines both search directions and the proximity measure between the iterate and the center path. The kernel function is neither a self-regular function nor the usual logarithmic kernel function. Besides, by using Euclidean Jordan algebraic techniques, we achieve the favorable iteration complexity O（ √r（1/2）（log r）^2 log（r/ ε））, which is as good as the convex quadratic semi-definite optimization analogue.展开更多
A Coupling Magneto-Electro-Elastic(MEE)Node-based Smoothed Radial Point Interpolation Method(CM-NS-RPIM)was proposed to solve the free vibration and transient responses of Functionally Graded Magneto-Electro-Elastic(F...A Coupling Magneto-Electro-Elastic(MEE)Node-based Smoothed Radial Point Interpolation Method(CM-NS-RPIM)was proposed to solve the free vibration and transient responses of Functionally Graded Magneto-Electro-Elastic(FGMEE)structures.By introducing the modified Newmark method,the displacement,electrical potential and magnetic potential of the structures under transient mechanical loading were obtained.Based on G space theory and the weakened weak(W2)formulation,the equations of the multi-physics coupling problems were derived.Using triangular background elements,the free vibration and transient responses of three numerical examples were studied.Results proved that CM-NS-RPIM performed better than the standard FEM by reducing the overly-stiff of structures.Moreover,CM-NS-RPIM could reduce the number of nodes while guaranteeing the accuracy.Besides,triangular elements could be generated automatically even for complex geometries.Therefore,the effectiveness and validity of CM-NS-RPIM were demonstrated,which were valuable for the design of intelligence devices,such as energy harvesters and sensors.展开更多
A new algorithm called homotopy iteration method based on the homotopy function is studied and improved. By the improved homotopy iteration method, Polynomial systems with high Order and deficient can be solved fast a...A new algorithm called homotopy iteration method based on the homotopy function is studied and improved. By the improved homotopy iteration method, Polynomial systems with high Order and deficient can be solved fast and efficiently comparing to the original homotopy iteration method. Numerical examples for the ninepoint path synthesis of four-bar linkages show the advantages and efficiency of the improved homotopy iteration method.展开更多
The choice of self-concordant functions is the key to efficient algorithms for linear and quadratic convex optimizations, which provide a method with polynomial-time iterations to solve linear and quadratic convex opt...The choice of self-concordant functions is the key to efficient algorithms for linear and quadratic convex optimizations, which provide a method with polynomial-time iterations to solve linear and quadratic convex optimization problems. The parameters of a self-concordant barrier function can be used to compute the complexity bound of the proposed algorithm. In this paper, it is proved that the finite barrier function is a local self-concordant barrier function. By deriving the local values of parameters of this barrier function, the desired complexity bound of an interior-point algorithm based on this local self-concordant function for linear optimization problem is obtained. The bound matches the best known bound for small-update methods.展开更多
A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Un...A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.展开更多
In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barr...In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O（nlog（n/c）） and O（√nlog（n/ε））. This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions.展开更多
In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps....In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasible interior-point methods.展开更多
Accurately approximating higher order derivatives is an inherently difficult problem. It is shown that a random variable shape parameter strategy can improve the accuracy of approximating higher order derivatives with...Accurately approximating higher order derivatives is an inherently difficult problem. It is shown that a random variable shape parameter strategy can improve the accuracy of approximating higher order derivatives with Radial Basis Function methods. The method is used to solve fourth order boundary value problems. The use and location of ghost points are examined in order to enforce the extra boundary conditions that are necessary to make a fourth-order problem well posed. The use of ghost points versus solving an overdetermined linear system via least squares is studied. For a general fourth-order boundary value problem, the recommended approach is to either use one of two novel sets of ghost centers introduced here or else to use a least squares approach. When using either ghost centers or least squares, the random variable shape parameter strategy results in significantly better accuracy than when a constant shape parameter is used.展开更多
This paper proposes a new full Nesterov-Todd(NT) step infeasible interior-point algorithm for semidefinite programming. Our algorithm uses a specific kernel function, which is adopted by Liu and Sun, to deduce the fea...This paper proposes a new full Nesterov-Todd(NT) step infeasible interior-point algorithm for semidefinite programming. Our algorithm uses a specific kernel function, which is adopted by Liu and Sun, to deduce the feasibility step. By using the step, it is remarkable that in each iteration of the algorithm it needs only one full-NT step, and can obtain an iterate approximate to the central path. Moreover, it is proved that the iterative bound corresponds with the known optimal one for semidefinite optimization problems.展开更多
In this paper,using the fixed-point and direct methods,we prove the HyersUlam stability of the following m-Appolonius type functional equation：∑mi=1 f（z-xi）=mf（z-1/m2∑mi=1xi）-1/m∑1≤i〈j≤mf（xi＋xj）,where m ...In this paper,using the fixed-point and direct methods,we prove the HyersUlam stability of the following m-Appolonius type functional equation：∑mi=1 f（z-xi）=mf（z-1/m2∑mi=1xi）-1/m∑1≤i〈j≤mf（xi＋xj）,where m is a natural number greater than 1,in random normed spaces. 更多还原展开更多
A penalized interior point approach for constrained nonlinear programming is examined in this work. To overcome the difficulty of initialization for the interior point method, a problem equivalent to the primal proble...A penalized interior point approach for constrained nonlinear programming is examined in this work. To overcome the difficulty of initialization for the interior point method, a problem equivalent to the primal problem via incorporating an auxiliary variable is constructed. A combined approach of logarithm barrier and quadratic penalty function is proposed to solve the problem. Based on Newton＇s method, the global convergence of interior point and line search algorithm is proven. Only a finite number of iterations is required to reach an approximate optimal solution. Numerical tests are given to show the effectiveness of the method.展开更多
In this paper, we introduce the following quattuordecic functional equation f(x+7y)-14f(x+6y)+91f(x+5y)-364f(x+4y)+1001f(x+3y)-2002f(x+2y)+3003f(x+y)-3432f(x)+3003f(x-y)-2002f(x-2y)+1001f(x-3y)-364f(x-4y)+91f(x-5y)-14...In this paper, we introduce the following quattuordecic functional equation f(x+7y)-14f(x+6y)+91f(x+5y)-364f(x+4y)+1001f(x+3y)-2002f(x+2y)+3003f(x+y)-3432f(x)+3003f(x-y)-2002f(x-2y)+1001f(x-3y)-364f(x-4y)+91f(x-5y)-14f(x-6y)+f(x-7y)=14!f(y), investigate the general solution and prove the stability of this quattuordecic functional equation in quasi β-normed spaces by using the fixed point method.展开更多
基金Supported by the Natural Science Foundation of Hubei Province(2008CDZD47)
文摘In this paper, we present a large-update primal-dual interior-point method for symmetric cone optimization（SCO） based on a new kernel function, which determines both search directions and the proximity measure between the iterate and the center path. The kernel function is neither a self-regular function nor the usual logarithmic kernel function. Besides, by using Euclidean Jordan algebraic techniques, we achieve the favorable iteration complexity O（ √r（1/2）（log r）^2 log（r/ ε））, which is as good as the convex quadratic semi-definite optimization analogue.
基金co-supported by the National Key R&D Program of China(Nos.2018YFF01012401-05)the National Natural Science Foundation of China(No.51975243)+2 种基金Jilin Provincial Department of Education(No.JJKH20180084KJ),Chinathe Fundamental Research Funds for the Central Universities and Jilin Provincial Department of Science&Technology Fund Project,China(Nos.20170101043JC and 20180520072JH)Graduate Innovation Fund of Jilin University,China(No.101832018C184).
文摘A Coupling Magneto-Electro-Elastic(MEE)Node-based Smoothed Radial Point Interpolation Method(CM-NS-RPIM)was proposed to solve the free vibration and transient responses of Functionally Graded Magneto-Electro-Elastic(FGMEE)structures.By introducing the modified Newmark method,the displacement,electrical potential and magnetic potential of the structures under transient mechanical loading were obtained.Based on G space theory and the weakened weak(W2)formulation,the equations of the multi-physics coupling problems were derived.Using triangular background elements,the free vibration and transient responses of three numerical examples were studied.Results proved that CM-NS-RPIM performed better than the standard FEM by reducing the overly-stiff of structures.Moreover,CM-NS-RPIM could reduce the number of nodes while guaranteeing the accuracy.Besides,triangular elements could be generated automatically even for complex geometries.Therefore,the effectiveness and validity of CM-NS-RPIM were demonstrated,which were valuable for the design of intelligence devices,such as energy harvesters and sensors.
文摘A new algorithm called homotopy iteration method based on the homotopy function is studied and improved. By the improved homotopy iteration method, Polynomial systems with high Order and deficient can be solved fast and efficiently comparing to the original homotopy iteration method. Numerical examples for the ninepoint path synthesis of four-bar linkages show the advantages and efficiency of the improved homotopy iteration method.
基金supported by the National Natural Science Foundation of China (Grant No.10771133)the Shanghai Leading Academic Discipline Project (Grant No.S30101)the Research Foundation for the Doctoral Program of Higher Education (Grant No.200802800010)
文摘The choice of self-concordant functions is the key to efficient algorithms for linear and quadratic convex optimizations, which provide a method with polynomial-time iterations to solve linear and quadratic convex optimization problems. The parameters of a self-concordant barrier function can be used to compute the complexity bound of the proposed algorithm. In this paper, it is proved that the finite barrier function is a local self-concordant barrier function. By deriving the local values of parameters of this barrier function, the desired complexity bound of an interior-point algorithm based on this local self-concordant function for linear optimization problem is obtained. The bound matches the best known bound for small-update methods.
基金supported by the National Natural Science Foundation of China (Grant No.10771133)the Shanghai Pujiang Program (Grant No.06PJ14039)
文摘A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.
基金Supported by the Natural Science Foundation of Hubei Province (2008CDZD47)
文摘In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O（nlog（n/c）） and O（√nlog（n/ε））. This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions.
文摘In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasible interior-point methods.
文摘Accurately approximating higher order derivatives is an inherently difficult problem. It is shown that a random variable shape parameter strategy can improve the accuracy of approximating higher order derivatives with Radial Basis Function methods. The method is used to solve fourth order boundary value problems. The use and location of ghost points are examined in order to enforce the extra boundary conditions that are necessary to make a fourth-order problem well posed. The use of ghost points versus solving an overdetermined linear system via least squares is studied. For a general fourth-order boundary value problem, the recommended approach is to either use one of two novel sets of ghost centers introduced here or else to use a least squares approach. When using either ghost centers or least squares, the random variable shape parameter strategy results in significantly better accuracy than when a constant shape parameter is used.
基金Sponsored by the National Natural Science Foundation of China(Grant No.11461021)the Natural Science Basic Research Plan in Shaanxi Province of China(Grant No.2017JM1014)Scientific Research Project of Hezhou University(Grant Nos.2014YBZK06 and 2016HZXYSX03)
文摘This paper proposes a new full Nesterov-Todd(NT) step infeasible interior-point algorithm for semidefinite programming. Our algorithm uses a specific kernel function, which is adopted by Liu and Sun, to deduce the feasibility step. By using the step, it is remarkable that in each iteration of the algorithm it needs only one full-NT step, and can obtain an iterate approximate to the central path. Moreover, it is proved that the iterative bound corresponds with the known optimal one for semidefinite optimization problems.
文摘In this paper,using the fixed-point and direct methods,we prove the HyersUlam stability of the following m-Appolonius type functional equation：∑mi=1 f（z-xi）=mf（z-1/m2∑mi=1xi）-1/m∑1≤i〈j≤mf（xi＋xj）,where m is a natural number greater than 1,in random normed spaces. 更多还原
基金supported by the National Natural Science Foundation of China (Grant No.10771133)the Shanghai Leading Academic Discipline Project (Grant Nos.J50101, S30104)
文摘A penalized interior point approach for constrained nonlinear programming is examined in this work. To overcome the difficulty of initialization for the interior point method, a problem equivalent to the primal problem via incorporating an auxiliary variable is constructed. A combined approach of logarithm barrier and quadratic penalty function is proposed to solve the problem. Based on Newton＇s method, the global convergence of interior point and line search algorithm is proven. Only a finite number of iterations is required to reach an approximate optimal solution. Numerical tests are given to show the effectiveness of the method.
文摘In this paper, we introduce the following quattuordecic functional equation f(x+7y)-14f(x+6y)+91f(x+5y)-364f(x+4y)+1001f(x+3y)-2002f(x+2y)+3003f(x+y)-3432f(x)+3003f(x-y)-2002f(x-2y)+1001f(x-3y)-364f(x-4y)+91f(x-5y)-14f(x-6y)+f(x-7y)=14!f(y), investigate the general solution and prove the stability of this quattuordecic functional equation in quasi β-normed spaces by using the fixed point method.
