This paper proposes an infeasible interior-point algorithm with full-Newton step for linear complementarity problem,which is an extension of Roos about linear optimization. The main iteration of the algorithm consists...This paper proposes an infeasible interior-point algorithm with full-Newton step for linear complementarity problem,which is an extension of Roos about linear optimization. The main iteration of the algorithm consists of a feasibility step and several centrality steps. At last,we prove that the algorithm has O(nlog n/ε) polynomial complexity,which coincides with the best known one for the infeasible interior-point algorithm at present.展开更多
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.展开更多
In this paper, on the basis of the logarithmic barrier function and KKT conditions, we propose a combined homotopy infeasible interior-point method （CHIIP） for convex nonlinear programming problems. For any convex n...In this paper, on the basis of the logarithmic barrier function and KKT conditions, we propose a combined homotopy infeasible interior-point method （CHIIP） for convex nonlinear programming problems. For any convex nonlinear programming, without strict convexity for the logarithmic barrier function, we get different solutions of the convex programming in different cases by CHIIP method.展开更多
On the basis of the formulations of the logarithmic barrier function and the idea of following the path of minimizers for the logarithmic barrier family of problems the so called "centralpath" for linear pro...On the basis of the formulations of the logarithmic barrier function and the idea of following the path of minimizers for the logarithmic barrier family of problems the so called "centralpath" for linear programming, we propose a new framework of primal-dual infeasible interiorpoint method for linear programming problems. Without the strict convexity of the logarithmic barrier function, we get the following results: (a) if the homotopy parameterμcan not reach to zero,then the feasible set of these programming problems is empty; (b) if the strictly feasible set is nonempty and the solution set is bounded, then for any initial point x, we can obtain a solution of the problems by this method; (c) if the strictly feasible set is nonempty and the solution set is unbounded, then for any initial point x, we can obtain a (?)-solution; and(d) if the strictly feasible set is nonempty and the solution set is empty, then we can get the curve x(μ), which towards to the generalized solutions.展开更多
Transmission line manipulations in a power system are necessary for the execution of preventative or corrective main- tenance in a network, thus ensuring the stability of the system. In this study, primal-dual interio...Transmission line manipulations in a power system are necessary for the execution of preventative or corrective main- tenance in a network, thus ensuring the stability of the system. In this study, primal-dual interior-point methods are used to minimize costs and losses in the generation and transmission of the predispatch active power flow in a hydroelectric system with previously scheduled line manipulations for preventative maintenance, over a period of twenty-four hours. The matrix structure of this problem and the modification that it imposes on the system is also broached in this study. From the computational standpoint, the effort required to solve a problem with or without line manipulations is similar, and the reasons for this are also discussed in this study. Computational results sustain our findings.展开更多
In this paper,we consider the maximal positive definite solution of the nonlinear matrix equation.By using the idea of Algorithm 2.1 in ZHANG(2013),a new inversion-free method with a stepsize parameter is proposed to ...In this paper,we consider the maximal positive definite solution of the nonlinear matrix equation.By using the idea of Algorithm 2.1 in ZHANG(2013),a new inversion-free method with a stepsize parameter is proposed to obtain the maximal positive definite solution of nonlinear matrix equation X+A^(*)X|^(-α)A=Q with the case 0<α≤1.Based on this method,a new iterative algorithm is developed,and its convergence proof is given.Finally,two numerical examples are provided to show the effectiveness of the proposed method.展开更多
In this paper,a novel method for investigating the particle-crushing behavior of breeding particles in a fusion blanket is proposed.The fractal theory and Weibull distribution are combined to establish a theoretical m...In this paper,a novel method for investigating the particle-crushing behavior of breeding particles in a fusion blanket is proposed.The fractal theory and Weibull distribution are combined to establish a theoretical model,and its validity was verified using a simple impact test.A crushable discrete element method(DEM)framework is built based on the previously established theoretical model.The tensile strength,which considers the fractal theory,size effect,and Weibull variation,was assigned to each generated particle.The assigned strength is then used for crush detection by comparing it with its maximum tensile stress.Mass conservation is ensured by inserting a series of sub-particles whose total mass was equal to the quality loss.Based on the crushable DEM framework,a numerical simulation of the crushing behavior of a pebble bed with hollow cylindrical geometry under a uniaxial compression test was performed.The results of this investigation showed that the particle withstands the external load by contact and sliding at the beginning of the compression process,and the results confirmed that crushing can be considered an important method of resisting the increasing external load.A relatively regular particle arrangement aids in resisting the load and reduces the occurrence of particle crushing.However,a limit exists to the promotion of resistance.When the strain increases beyond this limit,the distribution of the crushing position tends to be isotropic over the entire pebble bed.The theoretical model and crushable DEM framework provide a new method for exploring the pebble bed in a fusion reactor,considering particle crushing.展开更多
Effective partitioning is crucial for enabling parallel restoration of power systems after blackouts.This paper proposes a novel partitioning method based on deep reinforcement learning.First,the partitioning decision...Effective partitioning is crucial for enabling parallel restoration of power systems after blackouts.This paper proposes a novel partitioning method based on deep reinforcement learning.First,the partitioning decision process is formulated as a Markov decision process(MDP)model to maximize the modularity.Corresponding key partitioning constraints on parallel restoration are considered.Second,based on the partitioning objective and constraints,the reward function of the partitioning MDP model is set by adopting a relative deviation normalization scheme to reduce mutual interference between the reward and penalty in the reward function.The soft bonus scaling mechanism is introduced to mitigate overestimation caused by abrupt jumps in the reward.Then,the deep Q network method is applied to solve the partitioning MDP model and generate partitioning schemes.Two experience replay buffers are employed to speed up the training process of the method.Finally,case studies on the IEEE 39-bus test system demonstrate that the proposed method can generate a high-modularity partitioning result that meets all key partitioning constraints,thereby improving the parallelism and reliability of the restoration process.Moreover,simulation results demonstrate that an appropriate discount factor is crucial for ensuring both the convergence speed and the stability of the partitioning training.展开更多
The application of nitrogen fertilizers in agricultural fields can lead to the release of nitrogen-containing gases(NCGs),such as NO_(x),NH_(3) and N_(2)O,which can significantly impact regional atmospheric environmen...The application of nitrogen fertilizers in agricultural fields can lead to the release of nitrogen-containing gases(NCGs),such as NO_(x),NH_(3) and N_(2)O,which can significantly impact regional atmospheric environment and con-tribute to global climate change.However,there remain considerable research gaps in the accurate measurement of NCGs emissions from agricultural fields,hindering the development of effective emission reduction strategies.We improved an open-top dynamic chambers(OTDCs)system and evaluated the performance by comparing the measured and given fluxes of the NCGs.The results showed that the measured fluxes of NO,N_(2)O and NH_(3)were 1%,2%and 7%lower than the given fluxes,respectively.For the determination of NH_(3) concentration,we employed a stripping coil-ion chromatograph(SC-IC)analytical technique,which demonstrated an absorption efficiency for atmospheric NH_(3) exceeding 96.1%across sampling durations of 6 to 60 min.In the summer maize season,we utilized the OTDCs system to measure the exchange fluxes of NO,NH_(3),and N_(2)O from the soil in the North China Plain.Substantial emissions of NO,NH_(3) and N_(2)O were recorded following fertilization,with peaks of 107,309,1239 ng N/(m^(2)·s),respectively.Notably,significant NCGs emissions were observed following sus-tained heavy rainfall one month after fertilization,particularly with NH_(3) peak being 4.5 times higher than that observed immediately after fertilization.Our results demonstrate that the OTDCs system accurately reflects the emission characteristics of soil NCGs and meets the requirements for long-term and continuous flux observation.展开更多
Marine thin plates are susceptible to welding deformation owing to their low structural stiffness.Therefore,the efficient and accurate prediction of welding deformation is essential for improving welding quality.The t...Marine thin plates are susceptible to welding deformation owing to their low structural stiffness.Therefore,the efficient and accurate prediction of welding deformation is essential for improving welding quality.The traditional thermal elastic-plastic finite element method(TEP-FEM)can accurately predict welding deformation.However,its efficiency is low because of the complex nonlinear transient computation,making it difficult to meet the needs of rapid engineering evaluation.To address this challenge,this study proposes an efficient prediction method for welding deformation in marine thin plate butt welds.This method is based on the coupled temperature gradient-thermal strain method(TG-TSM)that integrates inherent strain theory with a shell element finite element model.The proposed method first extracts the distribution pattern and characteristic value of welding-induced inherent strain through TEP-FEM analysis.This strain is then converted into the equivalent thermal load applied to the shell element model for rapid computation.The proposed method-particularly,the gradual temperature gradient-thermal strain method(GTG-TSM)-achieved improved computational efficiency and consistent precision.Furthermore,the proposed method required much less computation time than the traditional TEP-FEM.Thus,this study lays the foundation for future prediction of welding deformation in more complex marine thin plates.展开更多
At present,there is currently a lack of unified standard methods for the determination of antimony content in groundwater in China.The precision and trueness of related detection technologies have not yet been systema...At present,there is currently a lack of unified standard methods for the determination of antimony content in groundwater in China.The precision and trueness of related detection technologies have not yet been systematically and quantitatively evaluated,which limits the effective implementation of environmental monitoring.In response to this key technical gap,this study aimed to establish a standardized method for determining antimony in groundwater using Hydride Generation–Atomic Fluorescence Spectrometry(HG-AFS).Ten laboratories participated in inter-laboratory collaborative tests,and the statistical analysis of the test data was carried out in strict accordance with the technical specifications of GB/T 6379.2—2004 and GB/T 6379.4—2006.The consistency and outliers of the data were tested by Mandel's h and k statistics,the Grubbs test and the Cochran test,and the outliers were removed to optimize the data,thereby significantly improving the reliability and accuracy.Based on the optimized data,parameters such as the repeatability limit(r),reproducibility limit(R),and method bias value(δ)were determined,and the trueness of the method was statistically evaluated.At the same time,precision-function relationships were established,and all results met the requirements.The results show that the lower the antimony content,the lower the repeatability limit(r)and reproducibility limit(R),indicating that the measurement error mainly originates from the detection limit of the method and instrument sensitivity.Therefore,improving the instrument sensitivity and reducing the detection limit are the keys to controlling the analytical error and improving precision.This study provides reliable data support and a solid technical foundation for the establishment and evaluation of standardized methods for the determination of antimony content in groundwater.展开更多
In this paper, motivated by the complexity results of Interior Point Methods （IPMs） for Linear Optimization （LO） based on kernel functions, we present a polynomial time IPM for solving P.（a）-linear complementari...In this paper, motivated by the complexity results of Interior Point Methods （IPMs） for Linear Optimization （LO） based on kernel functions, we present a polynomial time IPM for solving P.（a）-linear complementarity problem, using a new class of kernel functions. The special case of our new class was considered earlier for LO by Y. Q. Bai et al. in 2004. Using some appealing properties of the new class, we show that the iteration bound for IPMs matches the so far best known theoretical iteration bound for both large and small updates by choosing special values for the parameters of the new class.展开更多
Support vector machine(SVM)is a widely used method for classification.Proximal support vector machine(PSVM)is an extension of SVM and a promisingmethod to lead to a fast and simple algorithm for generating a classifie...Support vector machine(SVM)is a widely used method for classification.Proximal support vector machine(PSVM)is an extension of SVM and a promisingmethod to lead to a fast and simple algorithm for generating a classifier.Motivated by the fast computational efforts of PSVM and the properties of sparse solution yielded by l1-norm,in this paper,we first propose a PSVM with a cardinality constraint which is eventually relaxed byl1-norm and leads to a trade-offl1−l2 regularized sparse PSVM.Next we convert thisl1−l2 regularized sparse PSVM into an equivalent form of1 regularized least squares(LS)and solve it by a specialized interior-point method proposed by Kim et al.(J SelTop Signal Process 12:1932–4553,2007).Finally,l1−l2 regularized sparse PSVM is illustrated by means of a real-world dataset taken from the University of California,Irvine Machine Learning Repository(UCI Repository).Moreover,we compare the numerical results with the existing models such as generalized eigenvalue proximal SVM(GEPSVM),PSVM,and SVM-Light.The numerical results showthat thel1−l2 regularized sparsePSVMachieves not only better accuracy rate of classification than those of GEPSVM,PSVM,and SVM-Light,but also a sparser classifier compared with the1-PSVM.展开更多
In this study, hybrid computational frameworks are developed for active noise control（ANC） systems using an evolutionary computing technique based on genetic algorithms（GAs） and interior-point method（IPM）, follo...In this study, hybrid computational frameworks are developed for active noise control（ANC） systems using an evolutionary computing technique based on genetic algorithms（GAs） and interior-point method（IPM）, following an integrated approach, GA-IPM. Standard ANC systems are usually implemented with the filtered extended least mean square algorithm for optimization of coefficients for the linear finite-impulse response filter, but are likely to become trapped in local minima（LM）. This issue is addressed with the proposed GA-IPM computing approach which is considerably less prone to the LM problem. Also, there is no requirement to identify a secondary path for the ANC system used in the scheme. The design method is evaluated using an ANC model of a headset with sinusoidal, random, and complex random noise interferences under several scenarios based on linear and nonlinear primary and secondary paths. The accuracy and convergence of the proposed scheme are validated based on the results of statistical analysis of a large number of independent runs of the algorithm.展开更多
In this paper,a class of polynomial interior-point algorithms for P_(∗)(κ)-horizontal linear complementarity problems based on a newparametric kernel function is presented.The new parametric kernel function is used b...In this paper,a class of polynomial interior-point algorithms for P_(∗)(κ)-horizontal linear complementarity problems based on a newparametric kernel function is presented.The new parametric kernel function is used both for determining the search directions and for measuring the distance between the given iterate and theμ-center of the problem.We derive the complexity analysis for the algorithm,both with large and small updates.展开更多
We present a modified and simplified version of an infeasible interior-point method for second-order cone optimization published in 2013(Zangiabadi et al.in J Optim Theory Appl,2013).In the earlier version,each iterat...We present a modified and simplified version of an infeasible interior-point method for second-order cone optimization published in 2013(Zangiabadi et al.in J Optim Theory Appl,2013).In the earlier version,each iteration consisted of one socalled feasibility step and a few centering steps.Here,each iteration consists of only a feasibility step.Thus,the new algorithm improves the number of iterations and the improvement is due to a lemma which gives an upper bound for the proximity after the feasibility step.The complexity result coincides with the best-known iteration bound for infeasible interior-point methods.展开更多
this paper,we propose an infeasible-interior-point method,based on a new wide neighborhood of the central path,for linear complementarity problems over symmetric cones with the Cartesian P_(∗)(κ)-property.The converg...this paper,we propose an infeasible-interior-point method,based on a new wide neighborhood of the central path,for linear complementarity problems over symmetric cones with the Cartesian P_(∗)(κ)-property.The convergence is shown for commutative class of search directions.Moreover,we analyze the algorithm and obtain the complexity bounds,which coincide with the best-known results for the Cartesian P_(∗)(κ)-SCLCPs.Some numerical tests are reported to illustrate our theoretical results.展开更多
In this paper,a fu-Newton step interior-point algorithm is proposed for solving P_(*)(k)-linear complementarity problem based on a new search direction,which is an extension of Grimes'algorithm.It is proved that t...In this paper,a fu-Newton step interior-point algorithm is proposed for solving P_(*)(k)-linear complementarity problem based on a new search direction,which is an extension of Grimes'algorithm.It is proved that the number of iterations of the algorithm is O(n^(1/2)(1+4κ)logn/ε),which matches the best known iteration bound of the interior-point method for P_(*)(k)-linear complementarity problem.Some numerical results have proved the feasibility and efficiency of the proposed algorithm.展开更多
In this paper,we consider an optimization problem of the grasping manipulation of multi-fingered hand-arm robots.We first formulate an optimization model for the problem,based on the dynamic equations of the object a...In this paper,we consider an optimization problem of the grasping manipulation of multi-fingered hand-arm robots.We first formulate an optimization model for the problem,based on the dynamic equations of the object and the friction constraints.Then,we reformulate the model as a convex quadratic programming over circular cones.Moreover,we propose a primal-dual interior-point algorithm based on the kernel function to solve this convex quadratic programming over circular cones.We derive both the convergence of the algorithm and the iteration bounds for largeand small-update methods,respectively.Finally,we carry out the numerical tests of 180◦and 90◦manipulations of the hand-arm robot to demonstrate the effectiveness of the proposed algorithm.展开更多
This paper proposes an interior-point technique for detecting the nondominated points of multi-objective optimization problems using the direction-based cone method.Cone method decomposes the multi-objective optimizat...This paper proposes an interior-point technique for detecting the nondominated points of multi-objective optimization problems using the direction-based cone method.Cone method decomposes the multi-objective optimization problems into a set of single-objective optimization problems.For this set of problems,parametric perturbed KKT conditions are derived.Subsequently,an interior point technique is developed to solve the parametric perturbed KKT conditions.A differentiable merit function is also proposed whose stationary point satisfies the KKT conditions.Under some mild assumptions,the proposed algorithm is shown to be globally convergent.Numerical results of unconstrained and constrained multi-objective optimization test problems are presented.Also,three performance metrics(modified generational distance,hypervolume,inverted generational distance)are used on some test problems to investigate the efficiency of the proposed algorithm.We also compare the results of the proposed algorithm with the results of some other existing popular methods.展开更多
基金Supported by the National Natural Science Fund Finances Projects(71071119)
文摘This paper proposes an infeasible interior-point algorithm with full-Newton step for linear complementarity problem,which is an extension of Roos about linear optimization. The main iteration of the algorithm consists of a feasibility step and several centrality steps. At last,we prove that the algorithm has O(nlog n/ε) polynomial complexity,which coincides with the best known one for the infeasible interior-point algorithm at present.
基金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.
文摘In this paper, on the basis of the logarithmic barrier function and KKT conditions, we propose a combined homotopy infeasible interior-point method （CHIIP） for convex nonlinear programming problems. For any convex nonlinear programming, without strict convexity for the logarithmic barrier function, we get different solutions of the convex programming in different cases by CHIIP method.
文摘On the basis of the formulations of the logarithmic barrier function and the idea of following the path of minimizers for the logarithmic barrier family of problems the so called "centralpath" for linear programming, we propose a new framework of primal-dual infeasible interiorpoint method for linear programming problems. Without the strict convexity of the logarithmic barrier function, we get the following results: (a) if the homotopy parameterμcan not reach to zero,then the feasible set of these programming problems is empty; (b) if the strictly feasible set is nonempty and the solution set is bounded, then for any initial point x, we can obtain a solution of the problems by this method; (c) if the strictly feasible set is nonempty and the solution set is unbounded, then for any initial point x, we can obtain a (?)-solution; and(d) if the strictly feasible set is nonempty and the solution set is empty, then we can get the curve x(μ), which towards to the generalized solutions.
文摘Transmission line manipulations in a power system are necessary for the execution of preventative or corrective main- tenance in a network, thus ensuring the stability of the system. In this study, primal-dual interior-point methods are used to minimize costs and losses in the generation and transmission of the predispatch active power flow in a hydroelectric system with previously scheduled line manipulations for preventative maintenance, over a period of twenty-four hours. The matrix structure of this problem and the modification that it imposes on the system is also broached in this study. From the computational standpoint, the effort required to solve a problem with or without line manipulations is similar, and the reasons for this are also discussed in this study. Computational results sustain our findings.
基金Supported in part by Natural Science Foundation of Guangxi(2023GXNSFAA026246)in part by the Central Government's Guide to Local Science and Technology Development Fund(GuikeZY23055044)in part by the National Natural Science Foundation of China(62363003)。
文摘In this paper,we consider the maximal positive definite solution of the nonlinear matrix equation.By using the idea of Algorithm 2.1 in ZHANG(2013),a new inversion-free method with a stepsize parameter is proposed to obtain the maximal positive definite solution of nonlinear matrix equation X+A^(*)X|^(-α)A=Q with the case 0<α≤1.Based on this method,a new iterative algorithm is developed,and its convergence proof is given.Finally,two numerical examples are provided to show the effectiveness of the proposed method.
基金supported by Anhui Provincial Natural Science Foundation(2408085QA030)Natural Science Research Project of Anhui Educational Committee,China(2022AH050825)+3 种基金Medical Special Cultivation Project of Anhui University of Science and Technology(YZ2023H2C008)the Excellent Research and Innovation Team of Anhui Province,China(2022AH010052)the Scientific Research Foundation for High-level Talents of Anhui University of Science and Technology,China(2021yjrc51)Collaborative Innovation Program of Hefei Science Center,CAS,China(2019HSC-CIP006).
文摘In this paper,a novel method for investigating the particle-crushing behavior of breeding particles in a fusion blanket is proposed.The fractal theory and Weibull distribution are combined to establish a theoretical model,and its validity was verified using a simple impact test.A crushable discrete element method(DEM)framework is built based on the previously established theoretical model.The tensile strength,which considers the fractal theory,size effect,and Weibull variation,was assigned to each generated particle.The assigned strength is then used for crush detection by comparing it with its maximum tensile stress.Mass conservation is ensured by inserting a series of sub-particles whose total mass was equal to the quality loss.Based on the crushable DEM framework,a numerical simulation of the crushing behavior of a pebble bed with hollow cylindrical geometry under a uniaxial compression test was performed.The results of this investigation showed that the particle withstands the external load by contact and sliding at the beginning of the compression process,and the results confirmed that crushing can be considered an important method of resisting the increasing external load.A relatively regular particle arrangement aids in resisting the load and reduces the occurrence of particle crushing.However,a limit exists to the promotion of resistance.When the strain increases beyond this limit,the distribution of the crushing position tends to be isotropic over the entire pebble bed.The theoretical model and crushable DEM framework provide a new method for exploring the pebble bed in a fusion reactor,considering particle crushing.
基金funded by the Beijing Engineering Research Center of Electric Rail Transportation.
文摘Effective partitioning is crucial for enabling parallel restoration of power systems after blackouts.This paper proposes a novel partitioning method based on deep reinforcement learning.First,the partitioning decision process is formulated as a Markov decision process(MDP)model to maximize the modularity.Corresponding key partitioning constraints on parallel restoration are considered.Second,based on the partitioning objective and constraints,the reward function of the partitioning MDP model is set by adopting a relative deviation normalization scheme to reduce mutual interference between the reward and penalty in the reward function.The soft bonus scaling mechanism is introduced to mitigate overestimation caused by abrupt jumps in the reward.Then,the deep Q network method is applied to solve the partitioning MDP model and generate partitioning schemes.Two experience replay buffers are employed to speed up the training process of the method.Finally,case studies on the IEEE 39-bus test system demonstrate that the proposed method can generate a high-modularity partitioning result that meets all key partitioning constraints,thereby improving the parallelism and reliability of the restoration process.Moreover,simulation results demonstrate that an appropriate discount factor is crucial for ensuring both the convergence speed and the stability of the partitioning training.
基金supported by the National Key Research and Develop-ment Program(No.2022YFC3701103)the National Natural Science Foundation of China(Nos.42130714 and 41931287).
文摘The application of nitrogen fertilizers in agricultural fields can lead to the release of nitrogen-containing gases(NCGs),such as NO_(x),NH_(3) and N_(2)O,which can significantly impact regional atmospheric environment and con-tribute to global climate change.However,there remain considerable research gaps in the accurate measurement of NCGs emissions from agricultural fields,hindering the development of effective emission reduction strategies.We improved an open-top dynamic chambers(OTDCs)system and evaluated the performance by comparing the measured and given fluxes of the NCGs.The results showed that the measured fluxes of NO,N_(2)O and NH_(3)were 1%,2%and 7%lower than the given fluxes,respectively.For the determination of NH_(3) concentration,we employed a stripping coil-ion chromatograph(SC-IC)analytical technique,which demonstrated an absorption efficiency for atmospheric NH_(3) exceeding 96.1%across sampling durations of 6 to 60 min.In the summer maize season,we utilized the OTDCs system to measure the exchange fluxes of NO,NH_(3),and N_(2)O from the soil in the North China Plain.Substantial emissions of NO,NH_(3) and N_(2)O were recorded following fertilization,with peaks of 107,309,1239 ng N/(m^(2)·s),respectively.Notably,significant NCGs emissions were observed following sus-tained heavy rainfall one month after fertilization,particularly with NH_(3) peak being 4.5 times higher than that observed immediately after fertilization.Our results demonstrate that the OTDCs system accurately reflects the emission characteristics of soil NCGs and meets the requirements for long-term and continuous flux observation.
基金Supported by the National Natural Science Foundation of China under Grant No.51975138the High-Tech Ship Scientific Research Project from the Ministry of Industry and Information Technology under Grant No.CJ05N20the National Defense Basic Research Project under Grant No.JCKY2023604C006.
文摘Marine thin plates are susceptible to welding deformation owing to their low structural stiffness.Therefore,the efficient and accurate prediction of welding deformation is essential for improving welding quality.The traditional thermal elastic-plastic finite element method(TEP-FEM)can accurately predict welding deformation.However,its efficiency is low because of the complex nonlinear transient computation,making it difficult to meet the needs of rapid engineering evaluation.To address this challenge,this study proposes an efficient prediction method for welding deformation in marine thin plate butt welds.This method is based on the coupled temperature gradient-thermal strain method(TG-TSM)that integrates inherent strain theory with a shell element finite element model.The proposed method first extracts the distribution pattern and characteristic value of welding-induced inherent strain through TEP-FEM analysis.This strain is then converted into the equivalent thermal load applied to the shell element model for rapid computation.The proposed method-particularly,the gradual temperature gradient-thermal strain method(GTG-TSM)-achieved improved computational efficiency and consistent precision.Furthermore,the proposed method required much less computation time than the traditional TEP-FEM.Thus,this study lays the foundation for future prediction of welding deformation in more complex marine thin plates.
基金supported by the National Natural Science Foundation of China(Project No.42307555).
文摘At present,there is currently a lack of unified standard methods for the determination of antimony content in groundwater in China.The precision and trueness of related detection technologies have not yet been systematically and quantitatively evaluated,which limits the effective implementation of environmental monitoring.In response to this key technical gap,this study aimed to establish a standardized method for determining antimony in groundwater using Hydride Generation–Atomic Fluorescence Spectrometry(HG-AFS).Ten laboratories participated in inter-laboratory collaborative tests,and the statistical analysis of the test data was carried out in strict accordance with the technical specifications of GB/T 6379.2—2004 and GB/T 6379.4—2006.The consistency and outliers of the data were tested by Mandel's h and k statistics,the Grubbs test and the Cochran test,and the outliers were removed to optimize the data,thereby significantly improving the reliability and accuracy.Based on the optimized data,parameters such as the repeatability limit(r),reproducibility limit(R),and method bias value(δ)were determined,and the trueness of the method was statistically evaluated.At the same time,precision-function relationships were established,and all results met the requirements.The results show that the lower the antimony content,the lower the repeatability limit(r)and reproducibility limit(R),indicating that the measurement error mainly originates from the detection limit of the method and instrument sensitivity.Therefore,improving the instrument sensitivity and reducing the detection limit are the keys to controlling the analytical error and improving precision.This study provides reliable data support and a solid technical foundation for the establishment and evaluation of standardized methods for the determination of antimony content in groundwater.
基金Supported by a grant from IPM (Grant No. 8890027)
文摘In this paper, motivated by the complexity results of Interior Point Methods （IPMs） for Linear Optimization （LO） based on kernel functions, we present a polynomial time IPM for solving P.（a）-linear complementarity problem, using a new class of kernel functions. The special case of our new class was considered earlier for LO by Y. Q. Bai et al. in 2004. Using some appealing properties of the new class, we show that the iteration bound for IPMs matches the so far best known theoretical iteration bound for both large and small updates by choosing special values for the parameters of the new class.
基金This research was supported by the National Natural Science Foundation of China(No.11371242).
文摘Support vector machine(SVM)is a widely used method for classification.Proximal support vector machine(PSVM)is an extension of SVM and a promisingmethod to lead to a fast and simple algorithm for generating a classifier.Motivated by the fast computational efforts of PSVM and the properties of sparse solution yielded by l1-norm,in this paper,we first propose a PSVM with a cardinality constraint which is eventually relaxed byl1-norm and leads to a trade-offl1−l2 regularized sparse PSVM.Next we convert thisl1−l2 regularized sparse PSVM into an equivalent form of1 regularized least squares(LS)and solve it by a specialized interior-point method proposed by Kim et al.(J SelTop Signal Process 12:1932–4553,2007).Finally,l1−l2 regularized sparse PSVM is illustrated by means of a real-world dataset taken from the University of California,Irvine Machine Learning Repository(UCI Repository).Moreover,we compare the numerical results with the existing models such as generalized eigenvalue proximal SVM(GEPSVM),PSVM,and SVM-Light.The numerical results showthat thel1−l2 regularized sparsePSVMachieves not only better accuracy rate of classification than those of GEPSVM,PSVM,and SVM-Light,but also a sparser classifier compared with the1-PSVM.
文摘In this study, hybrid computational frameworks are developed for active noise control（ANC） systems using an evolutionary computing technique based on genetic algorithms（GAs） and interior-point method（IPM）, following an integrated approach, GA-IPM. Standard ANC systems are usually implemented with the filtered extended least mean square algorithm for optimization of coefficients for the linear finite-impulse response filter, but are likely to become trapped in local minima（LM）. This issue is addressed with the proposed GA-IPM computing approach which is considerably less prone to the LM problem. Also, there is no requirement to identify a secondary path for the ANC system used in the scheme. The design method is evaluated using an ANC model of a headset with sinusoidal, random, and complex random noise interferences under several scenarios based on linear and nonlinear primary and secondary paths. The accuracy and convergence of the proposed scheme are validated based on the results of statistical analysis of a large number of independent runs of the algorithm.
文摘In this paper,a class of polynomial interior-point algorithms for P_(∗)(κ)-horizontal linear complementarity problems based on a newparametric kernel function is presented.The new parametric kernel function is used both for determining the search directions and for measuring the distance between the given iterate and theμ-center of the problem.We derive the complexity analysis for the algorithm,both with large and small updates.
文摘We present a modified and simplified version of an infeasible interior-point method for second-order cone optimization published in 2013(Zangiabadi et al.in J Optim Theory Appl,2013).In the earlier version,each iteration consisted of one socalled feasibility step and a few centering steps.Here,each iteration consists of only a feasibility step.Thus,the new algorithm improves the number of iterations and the improvement is due to a lemma which gives an upper bound for the proximity after the feasibility step.The complexity result coincides with the best-known iteration bound for infeasible interior-point methods.
基金The authors were partially supported by the Center of Excellence for Mathematics,University of Shahrekord,Shahrekord,Iran.
文摘this paper,we propose an infeasible-interior-point method,based on a new wide neighborhood of the central path,for linear complementarity problems over symmetric cones with the Cartesian P_(∗)(κ)-property.The convergence is shown for commutative class of search directions.Moreover,we analyze the algorithm and obtain the complexity bounds,which coincide with the best-known results for the Cartesian P_(∗)(κ)-SCLCPs.Some numerical tests are reported to illustrate our theoretical results.
基金Supported by the Optimization Theory and Algorithm Research Team(23kytdzd004)the General Programs for Young Teacher Cultivation of Educational Commission of Anhui Province of China(YQYB2023090)the University Science Research Project of Anhui Province(2024AH050631)。
文摘In this paper,a fu-Newton step interior-point algorithm is proposed for solving P_(*)(k)-linear complementarity problem based on a new search direction,which is an extension of Grimes'algorithm.It is proved that the number of iterations of the algorithm is O(n^(1/2)(1+4κ)logn/ε),which matches the best known iteration bound of the interior-point method for P_(*)(k)-linear complementarity problem.Some numerical results have proved the feasibility and efficiency of the proposed algorithm.
基金the National Natural Science Foundation of China(No.11371242)。
文摘In this paper,we consider an optimization problem of the grasping manipulation of multi-fingered hand-arm robots.We first formulate an optimization model for the problem,based on the dynamic equations of the object and the friction constraints.Then,we reformulate the model as a convex quadratic programming over circular cones.Moreover,we propose a primal-dual interior-point algorithm based on the kernel function to solve this convex quadratic programming over circular cones.We derive both the convergence of the algorithm and the iteration bounds for largeand small-update methods,respectively.Finally,we carry out the numerical tests of 180◦and 90◦manipulations of the hand-arm robot to demonstrate the effectiveness of the proposed algorithm.
基金financial support from Council of Scientific and Industrial Research,India through a research fellowship(File No.09/1217(0025)/2017-EMR-I)to carry out this research workDebdas Ghosh acknowledges the research grant(MTR/2021/000696)from SERB,India to carry out this research work.
文摘This paper proposes an interior-point technique for detecting the nondominated points of multi-objective optimization problems using the direction-based cone method.Cone method decomposes the multi-objective optimization problems into a set of single-objective optimization problems.For this set of problems,parametric perturbed KKT conditions are derived.Subsequently,an interior point technique is developed to solve the parametric perturbed KKT conditions.A differentiable merit function is also proposed whose stationary point satisfies the KKT conditions.Under some mild assumptions,the proposed algorithm is shown to be globally convergent.Numerical results of unconstrained and constrained multi-objective optimization test problems are presented.Also,three performance metrics(modified generational distance,hypervolume,inverted generational distance)are used on some test problems to investigate the efficiency of the proposed algorithm.We also compare the results of the proposed algorithm with the results of some other existing popular methods.
