导师姓名：党亚峥
性别：女
人气指数：66

所属院校：河南理工大学
所属院系：计算机科学与技术学院
职称：讲师
导师类型：硕导
招生专业：
研究领域： 系统分析与集成，优化，智能电网
研究领域： 系统分析与集成，优化，智能电网 [收起]




通讯方式 :
电子邮件：jgdyz@163.com


个人简述 :
党亚峥，女，汉族，1973年12月生，博士，讲师，计算机学院硕士生导师。

科研工作 :
科研情况:
????? ??2011年1月-2014年12月。 基于非光滑分析和优化方法的混杂动态博弈研究（**） 国家基金委 38万
论文情况:
????? [1].党亚峥*, Yan Gao. The strong convergence of a KM–CQ-like algorithm for a split feasibility problem, Inverse Problems, 015007，27（9pp）, 2011 (SCI)[2].党亚峥*, Yan Gao. An extrapolated iterative algorithm for multile-set split feasibility problem, Abstract and Applied Analysis[J]，Vol.2012, Article ID 149508, 12\pp，DOI:10.1155/2012/149508, 2012 (SCI)[3]. 党亚峥*, Yan Gao. Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem, Optimization[J], 201414（3）：37-57(SCI)[4]. 党亚峥*, Yan Gao.The strong convergence of a three-step algorithm for the split feasibility problem, Optimization Letters[J]. 2013,7(6): 1325-1339 (SCI)[5]. 党亚峥*, Yan Gao. A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem, Applications of Mathematics[J], 2014,59(1), 37-51.(SCI) ；[6]．党亚峥* , Yan Gao. Inertial projection algorithms for convex feasibility problem, Journal of Systems Engineering and Electronics[J], 23(5), 734-740, 2012 (SCI)[7]. 党亚峥*, Yan Gao. A perturbed projection algorithm with inertial technique for split feasibility problem, Journal Applied Mathematics[J], DOI: 10.1155/2012/207323, 2012 (SCI)[9].党亚峥*, Yan Gao. Weak and Strong convergence of an algorithm for the split common fixed-point of asmptotically quasi-nonexpansive operators. Mathematical problem in engineering[J]. Volume 2013, 5 pages. (SCI)；[10].党亚峥*, Yan Gao. Inertial iteration for split common fixed-point problem for quasi-nonxpansive operators. Abstract and Applied Analysis[J]. Volume 2013, 5pages.SCI；[11]. 党亚峥*, Yan Gao. A strongly convergent parallel projection algorithm for convex feasibility problem, Journal of Applied Mathematics and Informatics[J], 2012.30(1-2):93-100[12]. 党亚峥*, Jingshujie. Nonmonotonic Trust Region Algorithm via the Conjugate Gradient Path for Unconstrained Generalized Geometric Programming, Chinese Quarterly Journal of Mathematics[J], 2011 26(2): 285-289.[13]. 党亚峥* Yan Gao.Block-iterative subgradient projection algorithms for the convex feasibility problem, Or Transactions[J], 15(1): 59-70, 2011[14]. 党亚峥*, Yan Gao., New Algorithms for a ConvexFeasibility Problem, Chinese Journal of Engineering Mathematics[J], 2013，12（1）：56-62[15].党亚峥*, Yan Gao., An Extrapolated Parallel Subgradient Projection Algorithm with Centering Technique for the Convex Feasibility Problem, Chinese Quarterly Journal of Mathematics[J]. 2013[16]. 党亚峥*. 高岩, 杨建芳.凸可行问题的一种强收敛算法[J]. 应用数学学报, 34(2), 303-312, 2011.