In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transform...In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transformation to derive the search direction.It is shown that the proximity measure reduces quadratically at each iteration.Moreover,the iteration bound of the algorithm is as good as the best-known polynomial complexity for these types of problems.Furthermore,numerical results are presented to show the efficiency of the proposed algorithm.展开更多
A class of preconditioned iterative methods, i.e., preconditioned generalized accelerated overrelaxation （GAOR） methods, is proposed to solve linear systems based on a class of weighted linear least squares problems...A class of preconditioned iterative methods, i.e., preconditioned generalized accelerated overrelaxation （GAOR） methods, is proposed to solve linear systems based on a class of weighted linear least squares problems. The convergence and comparison results are obtained. The comparison results show that the convergence rate of the preconditioned iterative methods is better than that of the original methods. Furthermore, the effectiveness of the proposed methods is shown in the numerical experiment.展开更多
In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear ...In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear growth term to derive the search direction,and by introducing new technical results and selecting suitable parameters,we prove that the iteration bound of the algorithm is as good as best-known polynomial complexity of interior-point methods.Furthermore,numerical results illustrate the efficiency of the proposed method.展开更多
The teaching–learning-based optimisation (TLBO) algorithm is a population-based metaheuristic inspired on the teaching–learning process observed in a classroom. It has been successfully used in a wide range of appli...The teaching–learning-based optimisation (TLBO) algorithm is a population-based metaheuristic inspired on the teaching–learning process observed in a classroom. It has been successfully used in a wide range of applications. In this study, the authors present a variant version of TLBO. In the proposed version, different weights are assigned to students during the student phase, with higher weights being assigned to students with better solutions. Three different approaches to assign weights are investigated. Numerical experiments with benchmark instances of the flow-shop and the job-shop scheduling problems are carried out to investigate the performance of the proposed approaches. They compare the proposed approaches with the original TLBO algorithm and with two variants of TLBOs proposed in the literature in terms of solution quality, convergence speed and simulation time. The results obtained by the application of a Friedman statistical test showed that the proposed approaches outperformed the original version of TLBO in terms of convergence, with no significant losses in the average makespan. The additional simulation time required by the proposed approaches is small. The best performance was achieved with the approach of assigning a fixed weight to half the students with the best solutions and assigning zero to other students.展开更多
Chain length of closed circle DNA is equal. The same closed circle DNA＇s position corresponds to different recognition sequence, and the same recognition sequence corresponds to different foreign DNA segment, so clos...Chain length of closed circle DNA is equal. The same closed circle DNA＇s position corresponds to different recognition sequence, and the same recognition sequence corresponds to different foreign DNA segment, so closed circle DNA computing model is generalized. For change positive-weighted Hamilton circuit problem, closed circle DNA algorithm is put forward. First, three groups of DNA encoding are encoded for all arcs, and deck groups are designed for all vertices. All possible solutions are composed. Then, the feasible solutions are filtered out by using group detect experiment, and the optimization solutions are obtained by using group insert experiment and electrophoresis experiment. Finally, all optimization solutions are found by using detect experiment. Complexity of algorithm is concluded and validity of DNA algorithm is explained by an example. Three dominances of the closed circle DNA algorithm are analyzed, and characteristics and dominances of group delete experiment are discussed.展开更多
In this paper, we establish the existence of at least four distinct solutions to an Kirchhoff type problems involving the critical Caffareli-Kohn-Niremberg exponent, concave term and sign-changing weights, by using th...In this paper, we establish the existence of at least four distinct solutions to an Kirchhoff type problems involving the critical Caffareli-Kohn-Niremberg exponent, concave term and sign-changing weights, by using the Nehari manifold and mountain pass theorem.展开更多
In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. T...In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.展开更多
In this work,we consider the inverse nodal problem for the Sturm-Liouville problem with a weight and the jump condition at the middle point.It is shown that the dense nodes of the eigenfunctions can uniquely determine...In this work,we consider the inverse nodal problem for the Sturm-Liouville problem with a weight and the jump condition at the middle point.It is shown that the dense nodes of the eigenfunctions can uniquely determine the potential on the whole interval and some parameters.展开更多
A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computatio...A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computational results show that the RWCEA performs better than a weight-coded evolutionary algorithm pro-posed by Raidl (1999) and to some existing benchmarks, it can yield better results than the ones reported in the OR-library.展开更多
Let n≥2 and let L be a second-order elliptic operator of divergence form with coefficients consisting of both an elliptic symmetric part and a BMO anti-symmetric part in ℝ^(n).In this article,we consider the weighted...Let n≥2 and let L be a second-order elliptic operator of divergence form with coefficients consisting of both an elliptic symmetric part and a BMO anti-symmetric part in ℝ^(n).In this article,we consider the weighted Kato square root problem for L.More precisely,we prove that the square root L^(1/2)satisfies the weighted L^(p)estimates||L^(1/2)(f)||L_(ω)^p(R^(n))≤C||■f||L_(ω)^p(R^(n);R^(n))for any p∈(1,∞)andω∈Ap(ℝ^(n))(the class of Muckenhoupt weights),and that||■f||L_(ω)^p(R^(n);R^(n))≤C||L^(1/2)(f)||L_(ω)^p(R^(n))for any p∈(1,2+ε)andω∈Ap(ℝ^(n))∩RH_(2+ε/p),(R^(n))(the class of reverse Hölder weights),whereε∈(0,∞)is a constant depending only on n and the operator L,and where(2+ε/p)'denotes the Hölder conjugate exponent of 2+ε/p.Moreover,for any given q∈(2,∞),we give a sufficient condition to obtain that||■f||L_(ω)^p(R^(n);R^(n))≤C||L^(1/2)(f)||L_(ω)^p(R^(n))for any p∈(1,q)andω∈A_(p)(R^(n))∩pRH_(q/p),(R^(n)).As an application,we prove that when the coefficient matrix A that appears in L satisfies the small BMO condition,the Riesz transform∇L^(−1/2)is bounded on L_(ω)^(p)(ℝ^(n))for any given p∈(1,∞)andω∈Ap(ℝ^(n)).Furthermore,applications to the weighted L^(2)-regularity problem with the Dirichlet or the Neumann boundary condition are also given.展开更多
In this paper,we consider generalized Christo®el-Minkowski problems as followsσ_(k)(u_(ij)+uδ_(ij))/σ_(l)(u_(ij)+uδ_(ij))=|u^(p-1)f(x),x∈S^(n),where 0≤l≤k≤n,p-1>0 and f is positive,and we establish the...In this paper,we consider generalized Christo®el-Minkowski problems as followsσ_(k)(u_(ij)+uδ_(ij))/σ_(l)(u_(ij)+uδ_(ij))=|u^(p-1)f(x),x∈S^(n),where 0≤l≤k≤n,p-1>0 and f is positive,and we establish the weighted gradient estimate and uniform C^(0)estimate for the positive convex even solutions,which is a generalization of Guan-Xia[1]and Guan[2].展开更多
In this paper, we investigate the effect of weight function in the nonlinear part on global solvability of the Cauchy problem for a class of semi-linear hyperbolic equations with damping.
In this paper, a new finite element method for the flow analysis of the viscous incompressible power-law fluid is proposed by the use of penalty-hybrid/mixed finite element formulation and by the introduction of an al...In this paper, a new finite element method for the flow analysis of the viscous incompressible power-law fluid is proposed by the use of penalty-hybrid/mixed finite element formulation and by the introduction of an alternative perturbation, which is weighted by viscosity, of the continuity equation. A numerical example is presented to exhibit the efficiency of the method.展开更多
A pseudo-cone in ℝ^(n) is a nonempty closed convex set K not containing the origin and such thatλK⊆K for allλ≥1.It is called a C-pseudo-cone if C is its recession cone,where C is a pointed closed convex cone with i...A pseudo-cone in ℝ^(n) is a nonempty closed convex set K not containing the origin and such thatλK⊆K for allλ≥1.It is called a C-pseudo-cone if C is its recession cone,where C is a pointed closed convex cone with interior points.The cone-volume measure of a pseudo-cone can be defined similarly as for convex bodies,but it may be infinite.After proving a necessary condition for cone-volume measures of C-pseudo-cones,we introduce suitable weights for cone-volume measures,yielding finite measures.Then we provide a necessary and sufficient condition for a Borel measure on the unit sphere to be the weighted cone-volume measure of some C-pseudo-cone.展开更多
The fabrication of high-precision panels for the compact antenna test range (CATR) with a sandwich construction of two aluminum skin-plates and one aluminum middle plate,which are bonded to two aluminum honeycomb core...The fabrication of high-precision panels for the compact antenna test range (CATR) with a sandwich construction of two aluminum skin-plates and one aluminum middle plate,which are bonded to two aluminum honeycomb core-layers poses a lot of tricky problems. Of them,the force analysis of individual skin-layers and the springback calculation of sandwich are of utmost importance. Under reasonable assumptions,by using Fourier expansion of stress function and power series expansion of deflection function,two boun...展开更多
A class of quasi-equilibrium problems and a class of constrained multiobjective games were introduced and studied in generalized convex spaces without linear structure. First, two existence theorems of solutions for q...A class of quasi-equilibrium problems and a class of constrained multiobjective games were introduced and studied in generalized convex spaces without linear structure. First, two existence theorems of solutions for quasi-equilibrium problems are proved in noncompact generalized convex spaces. Then, ar applications of the quasi-equilibrium existence theorem, several existence theorems of weighted Nash-equilibria and Pareto equilibria for the constrained multiobjective games are established in noncompact generalized convex spaces. These theorems improve, unify, and generalize the corresponding results of the multiobjective games in recent literatures.展开更多
In this article, we are concerned with the stability of stationary solution for outflow problem on the Navier-Stokes-Poisson system. We obtain the unique existence and the asymptotic stability of stationary solution. ...In this article, we are concerned with the stability of stationary solution for outflow problem on the Navier-Stokes-Poisson system. We obtain the unique existence and the asymptotic stability of stationary solution. Moreover, the convergence rate of solution towards stationary solution is obtained. Precisely, if an initial perturbation decays with the algebraic or the exponential rate in space, the solution converges to the corresponding stationary solution as time tends to infinity with the algebraic or the exponential rate in time. The proof is based on the weighted energy method by taking into account the effect of the self-consistent electric field on the viscous compressible fluid.展开更多
An ill-posed inverse problem in quantitative susceptibility mapping （QSM） is usually solved using a regularization and optimization solver, which is time consuming considering the three-dimensional volume data. Howe...An ill-posed inverse problem in quantitative susceptibility mapping （QSM） is usually solved using a regularization and optimization solver, which is time consuming considering the three-dimensional volume data. However, in clinical diagnosis, it is necessary to reconstruct a susceptibility map efficiently with an appropriate method. Here, a modified QSM reconstruction method called weighted total variation using split Bregman （WTVSB） is proposed. It reconstructs the susceptibility map with fast computational speed and effective artifact suppression by incorporating noise-suppressed data weighting with split Bregman iteration. The noise-suppressed data weighting is determined using the Laplacian of the calculated local field, which can prevent the noise and errors in field maps from spreading into the susceptibility inversion. The split Bregman iteration accelerates the solution of the Ll-regularized reconstruction model by utilizing a preconditioned conjugate gradient solver. In an experiment, the proposed reconstruction method is compared with truncated k-space division （TKD）, morphology enabled dipole inversion （MEDI）, total variation using the split Bregman （TVSB） method for numerical simulation, phantom and in vivo human brain data evaluated by root mean square error and mean structure similarity. Experimental results demonstrate that our proposed method can achieve better balance between accuracy and efficiency of QSM reconstruction than conventional methods, and thus facilitating clinical applications of QSM.展开更多
基金Supported by the Optimisation Theory and Algorithm Research Team(Grant No.23kytdzd004)University Science Research Project of Anhui Province(Grant No.2024AH050631)the General Programs for Young Teacher Cultivation of Educational Commission of Anhui Province(Grant No.YQYB2023090).
文摘In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transformation to derive the search direction.It is shown that the proximity measure reduces quadratically at each iteration.Moreover,the iteration bound of the algorithm is as good as the best-known polynomial complexity for these types of problems.Furthermore,numerical results are presented to show the efficiency of the proposed algorithm.
基金supported by the National Natural Science Foundation of China (No. 11071033)the Fundamental Research Funds for the Central Universities (No. 090405013)
文摘A class of preconditioned iterative methods, i.e., preconditioned generalized accelerated overrelaxation （GAOR） methods, is proposed to solve linear systems based on a class of weighted linear least squares problems. The convergence and comparison results are obtained. The comparison results show that the convergence rate of the preconditioned iterative methods is better than that of the original methods. Furthermore, the effectiveness of the proposed methods is shown in the numerical experiment.
基金Supported by University Science Research Project of Anhui Province(2023AH052921)Outstanding Youth Talent Project of Anhui Province(gxyq2021254)。
文摘In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear growth term to derive the search direction,and by introducing new technical results and selecting suitable parameters,we prove that the iteration bound of the algorithm is as good as best-known polynomial complexity of interior-point methods.Furthermore,numerical results illustrate the efficiency of the proposed method.
文摘The teaching–learning-based optimisation (TLBO) algorithm is a population-based metaheuristic inspired on the teaching–learning process observed in a classroom. It has been successfully used in a wide range of applications. In this study, the authors present a variant version of TLBO. In the proposed version, different weights are assigned to students during the student phase, with higher weights being assigned to students with better solutions. Three different approaches to assign weights are investigated. Numerical experiments with benchmark instances of the flow-shop and the job-shop scheduling problems are carried out to investigate the performance of the proposed approaches. They compare the proposed approaches with the original TLBO algorithm and with two variants of TLBOs proposed in the literature in terms of solution quality, convergence speed and simulation time. The results obtained by the application of a Friedman statistical test showed that the proposed approaches outperformed the original version of TLBO in terms of convergence, with no significant losses in the average makespan. The additional simulation time required by the proposed approaches is small. The best performance was achieved with the approach of assigning a fixed weight to half the students with the best solutions and assigning zero to other students.
基金supported by the National Natural Science Foundation of China(60574041)the Natural ScienceFoundation of Hubei Province(2007ABA407).
文摘Chain length of closed circle DNA is equal. The same closed circle DNA＇s position corresponds to different recognition sequence, and the same recognition sequence corresponds to different foreign DNA segment, so closed circle DNA computing model is generalized. For change positive-weighted Hamilton circuit problem, closed circle DNA algorithm is put forward. First, three groups of DNA encoding are encoded for all arcs, and deck groups are designed for all vertices. All possible solutions are composed. Then, the feasible solutions are filtered out by using group detect experiment, and the optimization solutions are obtained by using group insert experiment and electrophoresis experiment. Finally, all optimization solutions are found by using detect experiment. Complexity of algorithm is concluded and validity of DNA algorithm is explained by an example. Three dominances of the closed circle DNA algorithm are analyzed, and characteristics and dominances of group delete experiment are discussed.
文摘In this paper, we establish the existence of at least four distinct solutions to an Kirchhoff type problems involving the critical Caffareli-Kohn-Niremberg exponent, concave term and sign-changing weights, by using the Nehari manifold and mountain pass theorem.
文摘In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.
基金The research work was supported in part by the National Natural Science Foundation of China(11611530682 and 11871031).
文摘In this work,we consider the inverse nodal problem for the Sturm-Liouville problem with a weight and the jump condition at the middle point.It is shown that the dense nodes of the eigenfunctions can uniquely determine the potential on the whole interval and some parameters.
文摘A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computational results show that the RWCEA performs better than a weight-coded evolutionary algorithm pro-posed by Raidl (1999) and to some existing benchmarks, it can yield better results than the ones reported in the OR-library.
基金supported by the Key Project of Gansu Provincial National Science Foundation(23JRRA1022)the National Natural Science Foundation of China(12071431)+1 种基金the Fundamental Research Funds for the Central Universities(lzujbky-2021-ey18)the Innovative Groups of Basic Research in Gansu Province(22JR5RA391).
文摘Let n≥2 and let L be a second-order elliptic operator of divergence form with coefficients consisting of both an elliptic symmetric part and a BMO anti-symmetric part in ℝ^(n).In this article,we consider the weighted Kato square root problem for L.More precisely,we prove that the square root L^(1/2)satisfies the weighted L^(p)estimates||L^(1/2)(f)||L_(ω)^p(R^(n))≤C||■f||L_(ω)^p(R^(n);R^(n))for any p∈(1,∞)andω∈Ap(ℝ^(n))(the class of Muckenhoupt weights),and that||■f||L_(ω)^p(R^(n);R^(n))≤C||L^(1/2)(f)||L_(ω)^p(R^(n))for any p∈(1,2+ε)andω∈Ap(ℝ^(n))∩RH_(2+ε/p),(R^(n))(the class of reverse Hölder weights),whereε∈(0,∞)is a constant depending only on n and the operator L,and where(2+ε/p)'denotes the Hölder conjugate exponent of 2+ε/p.Moreover,for any given q∈(2,∞),we give a sufficient condition to obtain that||■f||L_(ω)^p(R^(n);R^(n))≤C||L^(1/2)(f)||L_(ω)^p(R^(n))for any p∈(1,q)andω∈A_(p)(R^(n))∩pRH_(q/p),(R^(n)).As an application,we prove that when the coefficient matrix A that appears in L satisfies the small BMO condition,the Riesz transform∇L^(−1/2)is bounded on L_(ω)^(p)(ℝ^(n))for any given p∈(1,∞)andω∈Ap(ℝ^(n)).Furthermore,applications to the weighted L^(2)-regularity problem with the Dirichlet or the Neumann boundary condition are also given.
基金Supported by National Natural Science Foundation of China(12171260).
文摘In this paper,we consider generalized Christo®el-Minkowski problems as followsσ_(k)(u_(ij)+uδ_(ij))/σ_(l)(u_(ij)+uδ_(ij))=|u^(p-1)f(x),x∈S^(n),where 0≤l≤k≤n,p-1>0 and f is positive,and we establish the weighted gradient estimate and uniform C^(0)estimate for the positive convex even solutions,which is a generalization of Guan-Xia[1]and Guan[2].
文摘In this paper, we investigate the effect of weight function in the nonlinear part on global solvability of the Cauchy problem for a class of semi-linear hyperbolic equations with damping.
文摘In this paper, a new finite element method for the flow analysis of the viscous incompressible power-law fluid is proposed by the use of penalty-hybrid/mixed finite element formulation and by the introduction of an alternative perturbation, which is weighted by viscosity, of the continuity equation. A numerical example is presented to exhibit the efficiency of the method.
文摘A pseudo-cone in ℝ^(n) is a nonempty closed convex set K not containing the origin and such thatλK⊆K for allλ≥1.It is called a C-pseudo-cone if C is its recession cone,where C is a pointed closed convex cone with interior points.The cone-volume measure of a pseudo-cone can be defined similarly as for convex bodies,but it may be infinite.After proving a necessary condition for cone-volume measures of C-pseudo-cones,we introduce suitable weights for cone-volume measures,yielding finite measures.Then we provide a necessary and sufficient condition for a Borel measure on the unit sphere to be the weighted cone-volume measure of some C-pseudo-cone.
基金National Natural Science Foundation of China (10477001, 60673056)
文摘The fabrication of high-precision panels for the compact antenna test range (CATR) with a sandwich construction of two aluminum skin-plates and one aluminum middle plate,which are bonded to two aluminum honeycomb core-layers poses a lot of tricky problems. Of them,the force analysis of individual skin-layers and the springback calculation of sandwich are of utmost importance. Under reasonable assumptions,by using Fourier expansion of stress function and power series expansion of deflection function,two boun...
文摘A class of quasi-equilibrium problems and a class of constrained multiobjective games were introduced and studied in generalized convex spaces without linear structure. First, two existence theorems of solutions for quasi-equilibrium problems are proved in noncompact generalized convex spaces. Then, ar applications of the quasi-equilibrium existence theorem, several existence theorems of weighted Nash-equilibria and Pareto equilibria for the constrained multiobjective games are established in noncompact generalized convex spaces. These theorems improve, unify, and generalize the corresponding results of the multiobjective games in recent literatures.
基金supported by the National Natural Science Foundation of China(11331005,11471134)the Program for Changjiang Scholars and Innovative Research Team in University(IRT13066)the Scientific Research Funds of Huaqiao University(15BS201,15BS309)
文摘In this article, we are concerned with the stability of stationary solution for outflow problem on the Navier-Stokes-Poisson system. We obtain the unique existence and the asymptotic stability of stationary solution. Moreover, the convergence rate of solution towards stationary solution is obtained. Precisely, if an initial perturbation decays with the algebraic or the exponential rate in space, the solution converges to the corresponding stationary solution as time tends to infinity with the algebraic or the exponential rate in time. The proof is based on the weighted energy method by taking into account the effect of the self-consistent electric field on the viscous compressible fluid.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11474236,81671674,and 11775184)the Science and Technology Project of Fujian Province,China(Grant No.2016Y0078)
文摘An ill-posed inverse problem in quantitative susceptibility mapping （QSM） is usually solved using a regularization and optimization solver, which is time consuming considering the three-dimensional volume data. However, in clinical diagnosis, it is necessary to reconstruct a susceptibility map efficiently with an appropriate method. Here, a modified QSM reconstruction method called weighted total variation using split Bregman （WTVSB） is proposed. It reconstructs the susceptibility map with fast computational speed and effective artifact suppression by incorporating noise-suppressed data weighting with split Bregman iteration. The noise-suppressed data weighting is determined using the Laplacian of the calculated local field, which can prevent the noise and errors in field maps from spreading into the susceptibility inversion. The split Bregman iteration accelerates the solution of the Ll-regularized reconstruction model by utilizing a preconditioned conjugate gradient solver. In an experiment, the proposed reconstruction method is compared with truncated k-space division （TKD）, morphology enabled dipole inversion （MEDI）, total variation using the split Bregman （TVSB） method for numerical simulation, phantom and in vivo human brain data evaluated by root mean square error and mean structure similarity. Experimental results demonstrate that our proposed method can achieve better balance between accuracy and efficiency of QSM reconstruction than conventional methods, and thus facilitating clinical applications of QSM.
