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

Harnessing Trend Theory to Enhance Distributed proximal point algorithm Approaches for Multi-Area Economic Dispatch Optimization

引用

Computers, Materials & Continua 2025年第3期82卷 4503-4533页

作者： Yaming Ren Xing Deng College of Mechanical and Control Engineering Guilin University of TechnologyGuilin541006China School of Computer Jiangsu University of Science and TechnologyZhenjiang212003China

The exponential growth in the scale of power systems has led to a significant increase in the complexity of dispatch problem resolution,particularly within multi-area interconnected power *** complexity necessitates the employment of distributed solution methodologies,which are not only essential but also highly *** the realm of computational modelling,the multi-area economic dispatch problem(MAED)can be formulated as a linearly constrained separable convex optimization *** proximal point algorithm(PPA)is particularly adept at addressing such mathematical constructs *** study introduces parallel(PPPA)and serial(SPPA)variants of the PPA as distributed algorithms,specifically designed for the computational modelling of the *** PPA introduces a quadratic term into the objective function,which,while potentially complicating the iterative updates of the algorithm,serves to dampen oscillations near the optimal solution,thereby enhancing the convergence ***,the convergence efficiency of the PPA is significantly influenced by the parameter *** address this parameter sensitivity,this research draws on trend theory from stock market analysis to propose trend theory-driven distributed PPPA and SPPA,thereby enhancing the robustness of the computational *** computational models proposed in this study are anticipated to exhibit superior performance in terms of convergence behaviour,stability,and robustness with respect to parameter selection,potentially outperforming existing methods such as the alternating direction method of multipliers(ADMM)and Auxiliary Problem Principle(APP)in the computational simulation of power system dispatch *** simulation results demonstrate that the trend theory-based PPPA,SPPA,ADMM and APP exhibit significant robustness to the initial value of parameter c,and show superior convergence characteristics compared to the residual balancing ADMM.

关键词： Multi-area economic dispatch problem proximal point algorithm trend theory

来源：评论

学校读者我要写书评

暂无评论

Convergence results for proximal point algorithm with inertial and correction terms

引用

APPLICABLE ANALYSIS 2025年第9期104卷 1732-1752页

作者： Izuchukwu, Chinedu Shehu, Yekini Yao, Jen-Chih Univ Witwatersrand Sch Math Johannesburg South Africa Zhejiang Normal Univ Sch Math Sci Jinhua Peoples R China China Med Univ Ctr Gen Educ Taichung Taiwan Azerbaijan State Univ Econ UNEC UNEC Math Modeling & Optimizat Res Ctr Baku Azerbaijan

This paper designs and studies a numerically fast proximal point algorithm to solve the monotone inclusion problem in Hilbert spaces. Our first proposed algorithm combines the proximal point algorithm, inertial term, and two correction terms. The addition of two correction terms is considered to further numerically accelerate the convergence speed of the inertial proximal point algorithm already studied in the literature. In our convergence results, we obtain both weak and linear convergence of the first proposed algorithm under some standard assumptions. Furthermore, we modify the first algorithm to obtain a strongly convergent algorithm. Applications of our proposed algorithm to mixed variational inequalities, strongly quasi-convex minimization problems, and Douglas-Rachford splitting algorithm are given. Numerical results show that our proposed algorithm outperforms other related algorithms in the literature.

关键词： proximal point algorithm correction term inertial extrapolation maximal monotone operators Hilbert spaces

来源：评论

学校读者我要写书评

暂无评论

proximal point algorithm FOR MINIMIZATION OF DC FUNCTION

引用

Journal of Computational Mathematics 2003年第4期21卷 451-462页

作者： Wen-yuSun Raimundo.J.B.Sampaio M.A.B.Candido SchoolofMathematicsandComputerScience NanjingNormalUniversityNanjing2100g7China ProgramadePos-GraduacaoemInformaticaAplicada PontificiaUniversidadeCatolicadoParana(PUCPR)CEP:80215-g01CuritibaPRBrazil ProgramadePos-GraduacaoemInformaticaAplicada PontificiaUniversidadeCatolicadoParana(PUCPR)CEP:80215-g01CuritibaPRBrazil

In this paper we present some algorithms for minimization of DC function (difference of two convex functions). They are descent methods of the proximal-type which use the convex properties of the two convex functions separately. We also consider an approximate proximal point algorithm. Some properties of the ε-subdifferential and the ε-directional derivative are discussed. The convergence properties of the algorithms are established in both exact and approximate forms. Finally, we give some applications to the concave programming and maximum eigenvalue problems.

关键词： Nonconvex optimization Nonsmooth optimization DC function proximal point algorithm ε-subgradient.

来源：评论

学校读者我要写书评

暂无评论

proximal point algorithm for a Common of Countable Families of Inverse Strongly Accretive Operators and Nonexpansive Mappings with Convergence Analysis

引用

MATHEMATICAL MODELLING AND ANALYSIS 2016年第1期21卷 95-118页

作者： Promluang, Khanittha Sitthithakerngkiet, Kanokwan Kumam, Poom KMUTT Dept Math Fac Sci 126 Pracha Uthit Rd Bangkok 10140 Thailand King Mongkuts Univ North Bangkok KMUTNB Fac Sci Appl Dept Math Nonlinear Dynam Anal Res Ctr 1518 Pracharat 1 Rd Bangkok 10800 Thailand KMUTT Theoret & Computat Sci TaCS Ctr Fac Sci Sci Lab Bldg126 Pracha Uthit Rd Bangkok 10140 Thailand China Med Univ 91 Hsueh Shih Rd Taichung 40402 Taiwan

In this paper, we investigate and analyze a proximal point algorithm via viscosity approximation method with error. This algorithm is introduced for finding a common zero point for a countable family of inverse strongly accretive operators and a countable family of nonexpansive mappings in Banach spaces. Our result can be extended to some well known results from a Hilbert space to a uniformly convex and 2 uniformly smooth Banach space. Finally, we establish the strong convergence theorems for the proximal point algorithm. Also, some illustrative numerical examples are presented.

关键词： proximal point algorithm Zero point inverse strongly accretive operator nonexpansive mapping

来源：评论

学校读者我要写书评

暂无评论

proximal point algorithm for inclusion problems in Hadamard manifolds with applications

引用

OPTIMIZATION LETTERS 2021年第3期15卷 901-921页

作者： Ansari, Qamrul Hasan Babu, Feeroz Aligarh Muslim Univ Dept Math Aligarh 202002 Uttar Pradesh India King Fahd Univ Petr & Minerals Dept Math & Stat Dhahran Saudi Arabia

This paper deals with the proximal point algorithm for finding a singularity of sum of a single-valued vector field and a set-valued vector field in the setting of Hadamard manifolds. The convergence analysis of the proposed algorithm is discussed. Applications to composite minimization problems and variational inequality problems are also presented.

关键词： Inclusion problems proximal point algorithm Composite minimization problems Variational inequality problems Maximal monotone vector fields Hadamard manifolds

来源：评论

学校读者我要写书评

暂无评论

proximal point algorithm for Quasi-Convex Minimization Problems in Metric Spaces

引用

NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION 2018年第4期39卷 438-448页

作者： Khatibzadeh, Hadi Mohebbi, Vahid Univ Zanjan Dept Math POB 45195-313 Zanjan Iran

In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove -convergence of the generated sequence to a critical point (which is defined in the text) of an objective quasi-convex, proper and lower semicontinuous function with at least a minimum point as well as some strong convergence results to a minimum point with some additional conditions. The results extend the recent results of the proximal point algorithm in Hadamard manifolds and CAT(0) spaces.

关键词： -convergence Hadamard space metric convergence minimization proximal point algorithm quasi-convex

来源：评论

学校读者我要写书评

暂无评论

proximal point algorithm for infinite pseudo-monotone bifunctions

引用

OPTIMIZATION 2016年第8期65卷 1629-1639页

作者： Khatibzadeh, Hadi Mohebbi, Vahid Univ Zanjan Dept Math Zanjan Iran

In this paper, first we study the weak convergence of the proximal point algorithm for an infinite family of equilibrium problems of pseudo-monotone type in Hilbert spaces. Then with additional conditions on the bifunctions, we prove the strong convergence for the family to a common equilibrium point. We also study a regularization of Halpern type and prove the strong convergence of the generated sequence to an equilibrium point of the family of infinite pseudo-monotone bifunctions without any additional assumptions on the bifunctions. A concrete example of a family of pseudo-monotone bifunctions is also presented.

关键词： Equilibrium problem pseudo-monotone bifunction proximal point algorithm weak convergence strong convergence Halpern's method

来源：评论

学校读者我要写书评

暂无评论

proximal point algorithm with Schur decomposition on the cone of symmetric semidefinite positive matrices

引用

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 2009年第2期355卷 469-478页

作者： Gregorio, Ronaldo Oliveira, Paulo Roberto Univ Fed Rio de Janeiro Comp & Syst Engn Dept BR-21945970 Rio De Janeiro Brazil

In this work, we propose a proximal algorithm for unconstrained optimization on the cone of symmetric semidefinite positive matrices. It appears to be the first in the proximal class on the set of methods that convert a Symmetric Definite Positive Optimization in Nonlinear Optimization. It replaces the main iteration of the conceptual proximal point algorithm by a sequence of nonlinear programming problems on the cone of diagonal definite positive matrices that has the structure of the positive orthant of the Euclidian vector space. We are motivated by results of the classical proximal algorithm extended to Riemannian manifolds with nonpositive sectional curvature. An important example of such a manifold is the space of symmetric definite positive matrices, where the metrics is given by the Hessian of the standard barrier function -In det(X). Observing the obvious fact that proximal algorithms do not depend on the geodesics, we apply those ideas to develop a proximal point algorithm for convex functions in this Riemannian metric. (c) 2009 Elsevier Inc. All rights reserved.

关键词： proximal point algorithm Hadamard manifold Schur decomposition Complete metric space Riemannian mean

来源：评论

学校读者我要写书评

暂无评论

proximal point algorithm for nonlinear multivalued type mappings in Hadamard spaces

引用

MATHEMATICAL METHODS IN THE APPLIED SCIENCES 2019年第17期42卷 5758-5768页

作者： Kumam, Wiyada Kitkuan, Duangkamon Padcharoen, Anantachai Kumam, Poom Rajamangala Univ Technol Thanyaburi RMUTT Fac Sci & Technol Dept Math & Comp Sci Program Appl Stat Thanyaburi Thailand KMUTT KMUTT Fixed Point Res Lab KMUTT Fixed Point Theory & Applicat Res Grp Theoret & Computat Sci Ctr TaCS 126 Pracha Uthit Rd Bangkok 10140 Thailand KMUTT Dept Math Fac Sci 126 Pracha Uthit Rd Bangkok 10140 Thailand China Med Univ China Med Univ Hosp Dept Med Res Taichung Taiwan

In this paper, we modify the proximal point algorithm for finding common fixed points in CAT(0) spaces for nonlinear multivalued mappings and a minimizer of a convex function and prove Delta-convergence of the proposed algorithm. A numerical example is presented to illustrate the convergence result. Our results improve and extend the corresponding results in the literature.

关键词： CAT(0) spaces common fixed points convex minimization problems nonlinear multivalued mappings proximal point algorithm

来源：评论

学校读者我要写书评

暂无评论

Entropy-Like Minimization Methods Based On Modified proximal point algorithm

引用

INFOR 2014年第3期52卷 147-156页

作者： Hamdi, Abdelouahed Bnouhachem, Abdellah Qatar Univ Dept Math Stat & Phys Doha Qatar Nanjing Univ Sch Management Sci & Engn Nanjing 210093 Jiangsu Peoples R China Ibn Zohr Univ ENSA Agadir Morocco

In this paper we introduce an extension of the proximal point algorithm proposed by Guler for solving convex minimization problems. This extension is obtained by substituting the usual quadratic proximal term by a class of convex nonquadratic entropy-like distances, called phi-divergences. A study of the convergence rate of this new proximal point method under mild assumptions is given, and further it is shown that this estimate rate is better than the available one of proximal-like methods. Some applications are given concerning general convex minimizations, linearly constrained convex programs and variationnal inequalities.

关键词： proximal point algorithm interior proximal methods nonquadratic regularizations variationnal inequalities

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：