检索结果-内蒙古大学图书馆

Convergence rate of a new projected-type algorithm solving non-Lipschitz equilibrium problems

COMPUTATIONAL & APPLIED MATHEMATICS 2020年第2期39卷 52-52页

作者： Hai Trinh Ngoc Hanoi Univ Sci & Technol Sch Appl Math & Informat 1st Dai Co Viet St Hanoi Vietnam

In this paper, we introduce a new step size strategy for projection-type algorithms for solving strongly pseudomonotone equilibrium problems in a Hilbert space. In contrast to the work by Anh et al. (Numer algorithms. 10.1007/s11075-018-0578-z, 2017) and by Santos et al. (Comput Appl Math 30:91-107, 2011), our methods do not require the step sizes being square summable. Moreover, at each step of the proposed algorithms, instead of solving a constrained problem, we only have to solve an unconstrained problem and compute a projection onto the feasible set or its intersection with a closed sphere. The strong convergence of the proposed algorithms is proven without any Lipschitz-type condition. Also, we evaluate the convergence rate of these algorithms. Using cutting hyperplanes, we refine the feasible set at the beginning of our algorithms. Thanks to this, we can apply the new algorithms to the equilibrium problems with non-closed and non-convex feasible set. Some numerical experiments and comparisons confirm efficiency of the proposed modification.

关键词： Equilibrium problem self-adaptive algorithm Shrinking feasible set Strong pseudomonotonicity

来源：评论

学校读者我要写书评

暂无评论

A Spintronic Memristor-Based Neural Network With Radial Basis Function for Robotic Manipulator Control Implementation

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2016年第4期46卷 582-588页

作者： Li, Tianshu Duan, Shukai Liu, Jun Wang, Lidan Huang, Tingwen Southwest Univ Coll Elect & Informat Engn Beibei 400715 Peoples R China Southwest Univ Coll Engn & Technol Beibei 400715 Peoples R China Texas A&M Univ Qatar Dept Elect & Comp Engn Doha 23874 Qatar

A radial basis function (RBF) neural network control algorithm can effectively improve the robotic manipulators' performance against a large amount of uncertainty. The adaptive law can be derived by using the Lyapunov method so that the stability of robotic manipulator control system and the weight self-adaptive convergence of RBF neural networks will be guaranteed. Meanwhile, system fluctuations and even overshot phenomenon under every start-up process, which are caused by the system's convergence from the given nonoptimal initial weight value to the optimal weight value, can be avoided by using memristors to remember the optimal weight after the system's first operation. According to the above analysis, this correspondence paper designs a kind of RBF neural network control algorithm based on spintronic memristors, and then analyzes its theoretical derivation process and core design idea. Finally, the system simulation model, which uses a two-link robotic manipulator as control object, is built to prove the algorithm's validity and feasibility. Simulation results show that the proposed algorithm can satisfy the effect of presupposition.

关键词： Crossbar array RBF neural network robotic manipulator self-adaptive algorithm spintronic memristor

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Accurate Solution Methodology for Bilevel Multi-Objective Programming Problems Using a Hybrid Evolutionary-Local-Search algorithm

引用

EVOLUTIONARY COMPUTATION 2010年第3期18卷 403-449页

作者： Deb, Kalyanmoy Sinha, Ankur Indian Inst Technol Kanpur Dept Mech Engn Kanpur 208016 Uttar Pradesh India Aalto Univ Sch Econ Dept Business Technol Helsinki 00076 Finland

Bilevel optimization problems involve two optimization tasks (upper and lower level), in which every feasible upper level solution must correspond to an optimal solution to a lower level optimization problem. These problems commonly appear in many practical problem solving tasks including optimal control, process optimization, game-playing strategy developments, transportation problems, and others. However, they are commonly converted into a single level optimization problem by using an approximate solution procedure to replace the lower level optimization task. Although there exist a number of theoretical, numerical, and evolutionary optimization studies involving single-objective bilevel programming problems, not many studies look at the context of multiple conflicting objectives in each level of a bilevel programming problem. In this paper, we address certain intricate issues related to solving multi-objective bilevel programming problems, present challenging test problems, and propose a viable and hybrid evolutionary-cum-local-search based algorithm as a solution methodology. The hybrid approach performs better than a number of existing methodologies and scales well up to 40-variable difficult test problems used in this study. The population sizing and termination criteria are made self-adaptive, so that no additional parameters need to be supplied by the user. The study indicates a clear niche of evolutionary algorithms in solving such difficult problems of practical importance compared to their usual solution by a computationally expensive nested procedure. The study opens up many issues related to multi-objective bilevel programming and hopefully this study will motivate EMO and other researchers to pay more attention to this important and difficult problem solving activity.

关键词： Bilevel optimization evolutionary multi-objective optimization NSGA-II test problem development problem difficulties hybrid evolutionary algorithms self-adaptive algorithm sequential quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Inertial accelerated algorithms for the split common fixed-point problem of directed operators

引用

OPTIMIZATION 2021年第5-6期70卷 1375-1407页

作者： Zhao, Jing Zhao, Ning-ning Hou, Dingfang Civil Aviat Univ China Coll Sci Tianjin Peoples R China Civil Aviat Univ China Coll Air Traff Management Tianjin Peoples R China

In this paper, we introduce two inertial accelerated algorithms for solving the split common fixed-point problem of directed operators in real Hilbert space. The proposed iterative algorithms combine the primal-dual method and the inertial method with the self-adaptive stepsizes such that the implementation of our algorithms does not need any prior information about bounded linear operator norms. Under suitable conditions, the weak and strong convergence results of the algorithms are obtained. Numerical results which involve image restoration problems are reported to show the effectiveness of the proposed algorithms.

关键词： Split common fixed-point problem directed operator inertial technique self-adaptive algorithm weak convergence

来源：评论

学校读者我要写书评

暂无评论

A generalized cyclic iterative method for solving variational inequalities over the solution set of a split common fixed point problem

引用

NUMERICAL algorithmS 2022年第1期91卷 1-17页

作者： Reich, Simeon Truong Minh Tuyen Technion Israel Inst Technol Dept Math IL-32000 Haifa Israel Thai Nguyen Univ Sci Dept Math & Informat Thai Nguyen 24000 Vietnam

We introduce a new generalized cyclic iterative method for finding solutions of variational inequalities over the solution set of a split common fixed point problem with multiple output sets in a real Hilbert space.

关键词： Hilbert space Metric projection Nonexpansive mapping self-adaptive algorithm Split common fixed point problem

来源：评论

学校读者我要写书评

暂无评论

Inertial relaxedCQalgorithms for solving a split feasibility problem in Hilbert spaces

引用

NUMERICAL algorithmS 2021年第3期87卷 1075-1095页

作者： Sahu, D. R. Cho, Y. J. Dong, Q. L. Kashyap, M. R. Li, X. H. Banaras Hindu Univ Inst Sci Dept Math Varanasi 221005 Uttar Pradesh India Gyeongsang Natl Univ Dept Math Educ Jinju 52828 South Korea Univ Elect Sci & Technol China Sch Math Sci Chengdu 611731 Sichuan Peoples R China Key Lab Adv Signal Proc Tianjin 300300 Peoples R China Coll Sci Tianjin 300300 Peoples R China Civil Aviat Univ China Tianjin 300300 Peoples R China

The split feasibility problem is to find a pointx*with the property thatx*is an element of CandAx*is an element of Q, whereCandQare nonempty closed convex subsets of real Hilbert spacesXandY, respectively, andAis a bounded linear operator fromXtoY. The split feasibility problem models inverse problems arising from phase retrieval problems and the intensity-modulated radiation therapy. In this paper, we introduce a new inertial relaxedCQalgorithm for solving the split feasibility problem in real Hilbert spaces and establish weak convergence of the proposedCQalgorithm under certain mild conditions. Our result is a significant improvement of the recent results related to the split feasibility problem.

关键词： Split feasibility problem CQ algorithm Inertial technique self-adaptive algorithm Weak convergence

来源：评论

学校读者我要写书评

暂无评论

A new iterative method for solving the multiple-set split variational inequality problem in Hilbert spaces

引用

OPTIMIZATION 2023年第6期72卷 1549-1575页

作者： Nguyen Thi Thu Thuy Nguyen Trung Nghia Hanoi Univ Sci & Technol Sch Appl Math & Informat Hanoi Vietnam

This paper proposes a new self-adaptive algorithm for solving the multiple-set split variational inequality problem in Hilbert spaces. Our algorithm uses dynamic step-sizes, chosen based on information of the previous step. In comparison with the work by Censor et al. [Numer algorithms. 2012;59:301-323], the new algorithm gives strong convergence results and does not require information about the transformation operator's norm. Some applications of our main results regarding the solution of the multiple-set split feasibility problem and the split feasibility problem are presented and show that the iterative method converges strongly under weaker assumptions than the ones used recently by Xu [Inverse Probl. 2006;22:2021-2034] and by Buong [Numer algorithms. 2017;76:783-798]. Numerical experiments on finite-dimensional and infinite-dimensional spaces and an application to discrete optimal control problems are reported to demonstrate the advantages and efficiency of the proposed algorithms over some existing results.

关键词： Variational inequality problems split feasibility problems multiple-set self-adaptive algorithm discrete optimal control problems

来源：评论

学校读者我要写书评

暂无评论

self-adaptive Histogram Equalization Image Enhancement Based on Canny Operator

Self-adaptive Histogram Equalization Image Enhancement Based...

引用

Annual Conference of the Chinese-Society-for-Optical-Engineering (CSOE) on Applied Optics and Photonics China (AOPC) - Optical Sensing and Imaging Technology and Applications

作者： Du, Ya-ni Zhou, Hui-xin Ma, Zhen-hua Yu, Yue Qin, Han-lin Tan, Wei Xidian Univ Sch Phys & Optoelect Engn Xian 710071 Shaanxi Peoples R China

ISBN: (数字)9781510614062

ISBN: (纸本)9781510614062;9781510614055

Traditional histogram equalization method always leads to the gray level reduction and loss of details. In this paper, an efficient and self-adaptive image enhancement algorithm is proposed based on canny operator and histogram equalization. The canny operator is used to extract the detail information which could be preserved in the enhanced image. The shortcomings of histogram equalization can thus be overcome. The experimental results with infrared images show that our method can preserve more image details and improve the image contrast and suppress noise effectively, which indicates a better performance for infrared image enhancement.

关键词： Histogram equalization image enhancement canny operator self-adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

PSO under an adaptive scheme

PSO under an adaptive scheme

引用

IEEE Congress on Evolutionary Computation

作者： Breaban, M Luchian, H Alexandru Ioan Cuza Univ Fac Comp Sci Iasi Romania

ISBN: (纸本)0780393635

This paper presents an attempt to transform PSO into a self-adaptive algorithm based on specific swarm-inspired operators. New features are introduced: spatial expansion intended to overcome premature convergence (an algorithm called Improved PSO, EPSO) and auto-adaptation (an algorithm called adaptive PSO, APSO). Experiments show that APSO and IPSO outperform the basic PSO on benchmark problems, proving their efficiency especially on multimodal functions.

关键词： adaptive systems convergence mathematical operators particle swarm optimisation adaptive system auto-adaptation multimodal functions particle swarm optimization premature convergence self-adaptive algorithm spatial expansion swarm-inspired operators Benchmark testing Particle swarm optimization adaptive systems IPSO Mathematical operators parametric subharmonic oscillator Converge

来源：评论

学校读者我要写书评

暂无评论

A Two-stage Codebook Design Based on Beam Perturbation for Massive MIMO Systems 31

A Two-stage Codebook Design Based on Beam Perturbation for M...

引用

31st IEEE International Conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Yuan, Jiangwei Li, Xiaohui Pu, Wenjuan Yuan, Ruiyang Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Shaanxi Peoples R China Xidian Univ Collaborat Innovat Ctr Informat Sensing & Underst Xian 710071 Shaanxi Peoples R China

ISBN: (纸本)9781509062317

Aiming at reducing the overhead of codebook design and improving the performance of massive multiple-input multiple-output (MIMO) systems, a novel two-stage codebook design is presented in this paper. Using the householder-transform, which perturbs the first-codebook beam direction, the second-codebook can be easily obtained. In addition, the second-codebook maintains the properties of the first-codebook and further simplifies the modality of perturbation. Then we introduce a self-adaptive algorithm for codebook selection to maximize the system performance. The self-adaptive algorithm dynamically chooses the optimal codeword of a two-stage codebook then feeds back one of the codewords to the transmitter, and it reduces feedback overhead and avoids the inaccurate channel matching caused by only using the second-codebook. Specifically, the algorithm increases the acceleration of codebook selection and reduces the complexity and blindness. The simulation results suggest that the proposed perturbation-based codebook design can improve the system bit error rate (BER) performance and can be applied to the case of multi-stream.

关键词： massive MIMO system first-codebook second-codebook self-adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：