In this paper,we obtain the convexity of new general integral operator on some classes of fc-uniformly p-valentα-convex functions of complex order.These results extend some known theorems.
We consider a first order periodic system in R^(N),involving a time dependent maximal monotone operator which need not have a full domain and a multivalued perturbation.We prove the existence theorems for both the con...We consider a first order periodic system in R^(N),involving a time dependent maximal monotone operator which need not have a full domain and a multivalued perturbation.We prove the existence theorems for both the convex and nonconvex problems.We also show the existence of extremal periodic solutions and provide a strong relaxation theorem.Finally,we provide an application to nonlinear periodic control systems.展开更多
When the edges of a convex polygon are traversed along one direction,the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons,a new algorithm for comp...When the edges of a convex polygon are traversed along one direction,the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons,a new algorithm for computing the convex hull of a simple polygon is proposed in this paper,which is then extended to a new algorithm for computing the convex hull of a planar point set. First,the extreme points of the planar point set are found,and the subsets of point candidate for vertex of the convex hull between extreme points are obtained. Then,the ordered convex hull point sequences between extreme points are constructed separately and concatenated by removing redundant extreme points to get the convex hull. The time complexity of the new planar convex hull algorithm is O(nlogh) ,which is equal to the time complexity of the best output-sensitive planar convex hull algorithms. Compared with the algorithm having the same complexity,the new algorithm is much faster.展开更多
In small-sample problems, determining and controlling the errors of ordinary rigid convex set models are difficult. Therefore, a new uncertainty model called the fuzzy convex set（FCS） model is built and investigated...In small-sample problems, determining and controlling the errors of ordinary rigid convex set models are difficult. Therefore, a new uncertainty model called the fuzzy convex set（FCS） model is built and investigated in detail. An approach was developed to analyze the fuzzy properties of the structural eigenvalues with FCS constraints. Through this method, the approximate possibility distribution of the structural eigenvalue can be obtained. Furthermore, based on the symmetric F-programming theory, the conditional maximum and minimum values for the structural eigenvalue are presented, which can serve as nonfuzzy quantitative indicators for fuzzy problems. A practical application is provided to demonstrate the practicability and effectiveness of the proposed methods.展开更多
An ellipsoidal Fourier-bound convex model (EFB model) is proposed in the present paper to express the uncertainty of seismic excitation, and several methods of selecting parameters of the model are explained. An analy...An ellipsoidal Fourier-bound convex model (EFB model) is proposed in the present paper to express the uncertainty of seismic excitation, and several methods of selecting parameters of the model are explained. An analytical expression is obtained for the worst response of the single-degree-of-freedom (SDOF) system with the EFB model. A numerical simulation shows that the traditional prediction of maximum response can yield the value substantially lover than that predicted by the EFB model. This means that the traditional designing method based on standard seismic inputs may lead to unsafe design decisions.展开更多
A improving Steady State Genetic Algorithm for global optimization over linear constraint non-convex programming problem is presented. By convex analyzing, the primal optimal problem can be converted to an equivalent ...A improving Steady State Genetic Algorithm for global optimization over linear constraint non-convex programming problem is presented. By convex analyzing, the primal optimal problem can be converted to an equivalent problem, in which only the information of convex extremes of feasible space is included, and is more easy for GAs to solve. For avoiding invalid genetic operators, a redesigned convex crossover operator is also performed in evolving. As a integrality, the quality of two problem is proven, and a method is also given to get all extremes in linear constraint space. Simulation result show that new algorithm not only converges faster, but also can maintain an diversity population, and can get the global optimum of test problem.展开更多
为了进一步提高极限学习机(extreme learning machine,ELM)的稳定性和稀疏性,在鲁棒ELM的基础上,引入l_(0)范数作为模型的正则项来提高稀疏性,建立了基于l_(0)范数正则项的稀疏鲁棒ELM。首先,通过一个凸差(difference of convex,DC)函...为了进一步提高极限学习机(extreme learning machine,ELM)的稳定性和稀疏性,在鲁棒ELM的基础上,引入l_(0)范数作为模型的正则项来提高稀疏性,建立了基于l_(0)范数正则项的稀疏鲁棒ELM。首先,通过一个凸差(difference of convex,DC)函数逼近l_(0)范数,得到一个DC规划的优化问题;然后,采用DC算法进行求解;最后,在人工数据集和基准数据集上进行实验。实验结果表明:基于l_(0)范数的鲁棒ELM能够同时实现稀疏性和鲁棒性的提升,尤其在稀疏性上表现出较大的优势。展开更多
基金Foundation item： Supported by the Natural Science Foundation of Inner Mongolia（2009MS0113） Sup- ported by the Higher School Research Foundation of Inner Mongolia（NJzy08150）
文摘In this paper,we obtain the convexity of new general integral operator on some classes of fc-uniformly p-valentα-convex functions of complex order.These results extend some known theorems.
基金supported by the NSFC(12071413)the Guangxi Natural Sci-ence Foundation(2023GXNSFAA026085)the European Union's Horizon 2020 Research and Innovation Programme under the Marie Sklodowska-Curie grant agreement No.823731 CONMECH。
文摘We consider a first order periodic system in R^(N),involving a time dependent maximal monotone operator which need not have a full domain and a multivalued perturbation.We prove the existence theorems for both the convex and nonconvex problems.We also show the existence of extremal periodic solutions and provide a strong relaxation theorem.Finally,we provide an application to nonlinear periodic control systems.
基金Project (No. 2004AA420100) supported by the National Hi-TechResearch and Development Program (863) of China
文摘When the edges of a convex polygon are traversed along one direction,the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons,a new algorithm for computing the convex hull of a simple polygon is proposed in this paper,which is then extended to a new algorithm for computing the convex hull of a planar point set. First,the extreme points of the planar point set are found,and the subsets of point candidate for vertex of the convex hull between extreme points are obtained. Then,the ordered convex hull point sequences between extreme points are constructed separately and concatenated by removing redundant extreme points to get the convex hull. The time complexity of the new planar convex hull algorithm is O(nlogh) ,which is equal to the time complexity of the best output-sensitive planar convex hull algorithms. Compared with the algorithm having the same complexity,the new algorithm is much faster.
基金supported by the National Natural Science Foundation of China (Grant 51509254)
文摘In small-sample problems, determining and controlling the errors of ordinary rigid convex set models are difficult. Therefore, a new uncertainty model called the fuzzy convex set（FCS） model is built and investigated in detail. An approach was developed to analyze the fuzzy properties of the structural eigenvalues with FCS constraints. Through this method, the approximate possibility distribution of the structural eigenvalue can be obtained. Furthermore, based on the symmetric F-programming theory, the conditional maximum and minimum values for the structural eigenvalue are presented, which can serve as nonfuzzy quantitative indicators for fuzzy problems. A practical application is provided to demonstrate the practicability and effectiveness of the proposed methods.
文摘An ellipsoidal Fourier-bound convex model (EFB model) is proposed in the present paper to express the uncertainty of seismic excitation, and several methods of selecting parameters of the model are explained. An analytical expression is obtained for the worst response of the single-degree-of-freedom (SDOF) system with the EFB model. A numerical simulation shows that the traditional prediction of maximum response can yield the value substantially lover than that predicted by the EFB model. This means that the traditional designing method based on standard seismic inputs may lead to unsafe design decisions.
文摘A improving Steady State Genetic Algorithm for global optimization over linear constraint non-convex programming problem is presented. By convex analyzing, the primal optimal problem can be converted to an equivalent problem, in which only the information of convex extremes of feasible space is included, and is more easy for GAs to solve. For avoiding invalid genetic operators, a redesigned convex crossover operator is also performed in evolving. As a integrality, the quality of two problem is proven, and a method is also given to get all extremes in linear constraint space. Simulation result show that new algorithm not only converges faster, but also can maintain an diversity population, and can get the global optimum of test problem.
文摘为了进一步提高极限学习机(extreme learning machine,ELM)的稳定性和稀疏性,在鲁棒ELM的基础上,引入l_(0)范数作为模型的正则项来提高稀疏性,建立了基于l_(0)范数正则项的稀疏鲁棒ELM。首先,通过一个凸差(difference of convex,DC)函数逼近l_(0)范数,得到一个DC规划的优化问题;然后,采用DC算法进行求解;最后,在人工数据集和基准数据集上进行实验。实验结果表明:基于l_(0)范数的鲁棒ELM能够同时实现稀疏性和鲁棒性的提升,尤其在稀疏性上表现出较大的优势。
