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.展开更多
Convex feasibility problems are widely used in image reconstruction,sparse signal recovery,and other areas.This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery...Convex feasibility problems are widely used in image reconstruction,sparse signal recovery,and other areas.This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery.We rst derive the projection formulas for a vector onto the feasible sets.The centralized circumcentered-reection method is designed to solve the convex feasibility problem.Some numerical experiments demonstrate the feasibility and e ectiveness of the proposed algorithm,showing superior performance compared to conventional alternating projection methods.展开更多
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.展开更多
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.展开更多
Modal parameters can accurately characterize the structural dynamic properties and assess the physical state of the structure.Therefore,it is particularly significant to identify the structural modal parameters accordi...Modal parameters can accurately characterize the structural dynamic properties and assess the physical state of the structure.Therefore,it is particularly significant to identify the structural modal parameters according to the monitoring data information in the structural health monitoring(SHM)system,so as to provide a scientific basis for structural damage identification and dynamic model modification.In view of this,this paper reviews methods for identifying structural modal parameters under environmental excitation and briefly describes how to identify structural damages based on the derived modal parameters.The paper primarily introduces data-driven modal parameter recognition methods(e.g.,time-domain,frequency-domain,and time-frequency-domain methods,etc.),briefly describes damage identification methods based on the variations of modal parameters(e.g.,natural frequency,modal shapes,and curvature modal shapes,etc.)and modal validation methods(e.g.,Stability Diagram and Modal Assurance Criterion,etc.).The current status of the application of artificial intelligence(AI)methods in the direction of modal parameter recognition and damage identification is further discussed.Based on the pre-vious analysis,the main development trends of structural modal parameter recognition and damage identification methods are given to provide scientific references for the optimized design and functional upgrading of SHM systems.展开更多
To analyze the differences in the transport and distribution of different types of proppants and to address issues such as the short effective support of proppant and poor placement in hydraulically intersecting fract...To analyze the differences in the transport and distribution of different types of proppants and to address issues such as the short effective support of proppant and poor placement in hydraulically intersecting fractures,this study considered the combined impact of geological-engineering factors on conductivity.Using reservoir production parameters and the discrete elementmethod,multispherical proppants were constructed.Additionally,a 3D fracture model,based on the specified conditions of the L block,employed coupled(Computational Fluid Dynamics)CFD-DEM(Discrete ElementMethod)for joint simulations to quantitatively analyze the transport and placement patterns of multispherical proppants in intersecting fractures.Results indicate that turbulent kinetic energy is an intrinsic factor affecting proppant transport.Moreover,the efficiency of placement and migration distance of low-sphericity quartz sand constructed by the DEM in the main fracture are significantly reduced compared to spherical ceramic proppants,with a 27.7%decrease in the volume fraction of the fracture surface,subsequently affecting the placement concentration and damaging fracture conductivity.Compared to small-angle fractures,controlling artificial and natural fractures to expand at angles of 45°to 60°increases the effective support length by approximately 20.6%.During hydraulic fracturing of gas wells,ensuring the fracture support area and post-closure conductivity can be achieved by controlling the sphericity of proppants and adjusting the perforation direction to control the direction of artificial fractures.展开更多
This study investigated the physicochemical properties,enzyme activities,volatile flavor components,microbial communities,and sensory evaluation of high-temperature Daqu(HTD)during the maturation process,and a standar...This study investigated the physicochemical properties,enzyme activities,volatile flavor components,microbial communities,and sensory evaluation of high-temperature Daqu(HTD)during the maturation process,and a standard system was established for comprehensive quality evaluation of HTD.There were obvious changes in the physicochemical properties,enzyme activities,and volatile flavor components at different storage periods,which affected the sensory evaluation of HTD to a certain extent.The results of high-throughput sequencing revealed significant microbial diversity,and showed that the bacterial community changed significantly more than did the fungal community.During the storage process,the dominant bacterial genera were Kroppenstedtia and Thermoascus.The correlation between dominant microorganisms and quality indicators highlighted their role in HTD quality.Lactococcus,Candida,Pichia,Paecilomyces,and protease activity played a crucial role in the formation of isovaleraldehyde.Acidic protease activity had the greatest impact on the microbial community.Moisture promoted isobutyric acid generation.Furthermore,the comprehensive quality evaluation standard system was established by the entropy weight method combined with multi-factor fuzzy mathematics.Consequently,this study provides innovative insights for comprehensive quality evaluation of HTD during storage and establishes a groundwork for scientific and rational storage of HTD and quality control of sauce-flavor Baijiu.展开更多
基金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 the Natural Science Foundation of Guangxi Province(Grant Nos.2023GXNSFAA026067,2024GXN SFAA010521)the National Natural Science Foundation of China(Nos.12361079,12201149,12261026).
文摘Convex feasibility problems are widely used in image reconstruction,sparse signal recovery,and other areas.This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery.We rst derive the projection formulas for a vector onto the feasible sets.The centralized circumcentered-reection method is designed to solve the convex feasibility problem.Some numerical experiments demonstrate the feasibility and e ectiveness of the proposed algorithm,showing superior performance compared to conventional alternating projection methods.
基金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 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.
基金supported by the Innovation Foundation of Provincial Education Department of Gansu(2024B-005)the Gansu Province National Science Foundation(22YF7GA182)the Fundamental Research Funds for the Central Universities(No.lzujbky2022-kb01)。
文摘Modal parameters can accurately characterize the structural dynamic properties and assess the physical state of the structure.Therefore,it is particularly significant to identify the structural modal parameters according to the monitoring data information in the structural health monitoring(SHM)system,so as to provide a scientific basis for structural damage identification and dynamic model modification.In view of this,this paper reviews methods for identifying structural modal parameters under environmental excitation and briefly describes how to identify structural damages based on the derived modal parameters.The paper primarily introduces data-driven modal parameter recognition methods(e.g.,time-domain,frequency-domain,and time-frequency-domain methods,etc.),briefly describes damage identification methods based on the variations of modal parameters(e.g.,natural frequency,modal shapes,and curvature modal shapes,etc.)and modal validation methods(e.g.,Stability Diagram and Modal Assurance Criterion,etc.).The current status of the application of artificial intelligence(AI)methods in the direction of modal parameter recognition and damage identification is further discussed.Based on the pre-vious analysis,the main development trends of structural modal parameter recognition and damage identification methods are given to provide scientific references for the optimized design and functional upgrading of SHM systems.
基金funded by the project of the Major Scientific and Technological Projects of CNOOC in the 14th Five-Year Plan(No.KJGG2022-0701)the CNOOC Research Institute(No.2020PFS-03).
文摘To analyze the differences in the transport and distribution of different types of proppants and to address issues such as the short effective support of proppant and poor placement in hydraulically intersecting fractures,this study considered the combined impact of geological-engineering factors on conductivity.Using reservoir production parameters and the discrete elementmethod,multispherical proppants were constructed.Additionally,a 3D fracture model,based on the specified conditions of the L block,employed coupled(Computational Fluid Dynamics)CFD-DEM(Discrete ElementMethod)for joint simulations to quantitatively analyze the transport and placement patterns of multispherical proppants in intersecting fractures.Results indicate that turbulent kinetic energy is an intrinsic factor affecting proppant transport.Moreover,the efficiency of placement and migration distance of low-sphericity quartz sand constructed by the DEM in the main fracture are significantly reduced compared to spherical ceramic proppants,with a 27.7%decrease in the volume fraction of the fracture surface,subsequently affecting the placement concentration and damaging fracture conductivity.Compared to small-angle fractures,controlling artificial and natural fractures to expand at angles of 45°to 60°increases the effective support length by approximately 20.6%.During hydraulic fracturing of gas wells,ensuring the fracture support area and post-closure conductivity can be achieved by controlling the sphericity of proppants and adjusting the perforation direction to control the direction of artificial fractures.
文摘This study investigated the physicochemical properties,enzyme activities,volatile flavor components,microbial communities,and sensory evaluation of high-temperature Daqu(HTD)during the maturation process,and a standard system was established for comprehensive quality evaluation of HTD.There were obvious changes in the physicochemical properties,enzyme activities,and volatile flavor components at different storage periods,which affected the sensory evaluation of HTD to a certain extent.The results of high-throughput sequencing revealed significant microbial diversity,and showed that the bacterial community changed significantly more than did the fungal community.During the storage process,the dominant bacterial genera were Kroppenstedtia and Thermoascus.The correlation between dominant microorganisms and quality indicators highlighted their role in HTD quality.Lactococcus,Candida,Pichia,Paecilomyces,and protease activity played a crucial role in the formation of isovaleraldehyde.Acidic protease activity had the greatest impact on the microbial community.Moisture promoted isobutyric acid generation.Furthermore,the comprehensive quality evaluation standard system was established by the entropy weight method combined with multi-factor fuzzy mathematics.Consequently,this study provides innovative insights for comprehensive quality evaluation of HTD during storage and establishes a groundwork for scientific and rational storage of HTD and quality control of sauce-flavor Baijiu.
