相关期刊:《Journal of Electronic Research and Application》《Journal of Mathematical Research with Applications》《Science China Mathematics》《Science Bulletin》更多>>
supported by the National Natural Science Foundation of China(Grant No.61922087);the Huxiang Young Talents Program of Hunan Province(2021RC3070).
Unsupervised transfer subspace learning is one of the challenging and important topics in domain adaptation,which aims to classify unlabeled target data by using source domain information.The traditional transfer subs...
2024 Jiangsu Province Youth Science and Technology Talent Support Project;2024 Yancheng Key Research and Development Plan(Social Development)projects,“Research and Application of Multi Agent Offline Distributed Trust Perception Virtual Wireless Sensor Network Algorithm”and“Research and Application of a New Type of Fishery Ship Safety Production Monitoring Equipment”。
This paper mainly focuses on the velocity-constrained consensus problem of discrete-time heterogeneous multi-agent systems with nonconvex constraints and arbitrarily switching topologies,where each agent has first-ord...
This paper considers the finite element approximation to parabolic optimal control problems with measure data in a nonconvex polygonal domain.Such problems usually possess low regularity in the state variable due to t...
supported by the National Natural Science Foundation of China(No.12001286);the Project funded by China Postdoctoral Science Foundation(No.2022M711672).
This paper presents a general framework for addressing sparse portfolio optimization problems using the mean-CVaR(Conditional Value-at-Risk)model and regularization techniques.The framework incorporates a non-negative...
Supported by National Natural Science Foundation of China(Grant Nos.52075353,52007128).
As an important part of rotating machinery,gearboxes often fail due to their complex working conditions and harsh working environment.Therefore,it is very necessary to effectively extract the fault features of the gea...
supported by the Guangxi Science and Technology base and Talent Project(AD22080047);the National Natural Science Foundation of Guangxi Province(2023GXNFSBA 026063);the Innovation Funds of Chinese University(2021BCF03001);the special foundation for Guangxi Ba Gui Scholars.
A cautious projection BFGS method is proposed for solving nonconvex unconstrained optimization problems.The global convergence of this method as well as a stronger general convergence result can be proven without a gr...
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 con...
partially funded by AFOSR MURI FA9550-18-502,ONR N00014-18-1-2527,N00014-18-20-1-2093,N00014-20-1-2787;supported by the NSF Graduate Research Fellowship under Grant No.DGE-1650604.
Computing tasks may often be posed as optimization problems.The objective functions for real-world scenarios are often nonconvex and/or nondifferentiable.State-of-the-art methods for solving these problems typically o...
supported by the Zhejiang Provincial Natural Science Foundation of China under grant No.LQ21A010003.
In this paper,we offer a new sparse recovery strategy based on the generalized error function.The introduced penalty function involves both the shape and the scale parameters,making it extremely flexible.For both cons...
In this paper, our focus lies on addressing a two-block linearly constrained nonseparable nonconvex optimization problem with coupling terms. The most classical algorithm, the alternating direction method of multiplie...