检索结果-南通市图书馆

Enhanced performance of solution-processed carbon nanotube transparent electrodes in foldable perovskite solar cells through vertical separation of binders by using eco-friendly parylene substrate

在线全文

学校读者我要写书评

暂无评论

Carbon Energy 2024年第7期6卷 83-93页

作者： Unsoo Kim Jeong-Seok Nam Jungjin Yoon jiye han Mansoo Choi Il Jeon Department of Mechanical Engineering Seoul National UniversitySeoulRepublic of Korea Global Frontier Center for Multiscale Energy Systems Seoul National UniversitySeoulRepublic of Korea Frontier Energy Solution SeoulRepublic of Korea Department of Nano Engineering Department of Nano Science and TechnologySKKU Advanced Institute of Nanotechnology(SAINT)Sungkyunkwan University(SKKU)SuwonRepublic of Korea Department of Materials Science and Engineering Pennsylvania State UniversityUniversity ParkPennsylvaniaUSA

The successful utilization of an eco-friendly and biocompatible parylene-C substrate for high-performance solution-processed double-walled carbon nanotube(CNT)electrode-based perovskite solar cells(PSCs)was *** the use of a novel inversion transfer technique,vertical separation of the binders from the CNTs was induced,rendering a stronger p-doping effect and thereby a higher conductivity of the *** resulting foldable devices exhibited a power conversion efficiency of 18.11%,which is the highest reported among CNT transparent electrode-based PSCs to date,and withstood more than 10,000 folding cycles at a radius of 0.5 mm,demonstrating unprecedented mechanical ***,solar modules were fabricated using entirely laser scribing processes to assess the potential of the solution-processable nanocarbon ***,this is the only one to be processed entirely by the laser scribing process and to be biocompatible as well as eco-friendly among the previously reported nonindium tin oxide-based perovskite solar modules.

关键词： double-walled carbon nanotubes parylene substrates perovskite modules perovskite solar cells solution-processable electrodes surfactant removal

GLOBAL CONVERGENCE OF UNCONSTRAINED MINIMIZATION METHODS WITH A GENERALIZED BACKTRACKING LINESEARCH PROCEDURE

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Systems Science and Mathematical Sciences 1995年第2期8卷 122-127页

作者： LIU Guanghui han jiye(Institute of Applied Mathematics, Academia Sinica, Beijing 100080,China)

ＧＬＯＢＡＬＣＯＮＶＥＲＧＥＮＣＥＯＦＵＮＣＯＮＳＴＲＡＩＮＥＤＭＩＮＩＭＩＺＡＴＩＯＮＭＥＴＨＯＤＳＷＩＴＨＡＧＥＮＥＲＡＬＩＺＥＤＢＡＣＫＴＲＡＣＫＩＮＧＬＩＮＥＳＥＡＲＣＨＰＲＯＣＥＤＵＲＥＬＩＵＧｕａｎｇｈｕ... 详细信息

ＧＬＯＢＡＬＣＯＮＶＥＲＧＥＮＣＥＯＦＵＮＣＯＮＳＴＲＡＩＮＥＤＭＩＮＩＭＩＺＡＴＩＯＮＭＥＴＨＯＤＳＷＩＴＨＡＧＥＮＥＲＡＬＩＺＥＤＢＡＣＫＴＲＡＣＫＩＮＧＬＩＮＥＳＥＡＲＣＨＰＲＯＣＥＤＵＲＥＬＩＵＧｕａｎｇｈｕｉ；ＨＡＮＪｉｙｅ（Ｉｎｓｔｉｔｕ...

关键词： Backtracking linesearch direction selection rule BFGS method global convergencet unconstrained optimization

OPTIMALITY CONDITIONS FOR NONCONVEX BILEVEL PROGRAMMING PROBLEMS

在线全文

学校读者我要写书评

暂无评论

Systems Science and Mathematical Sciences 1997年第2期10卷 183-192页

作者： LIU Guoshan han jiye (Institute of Aoolied Mathematics, Academia Sinica, Beijing 100080, China) 中科院应用数学所北京

In this paper, we derive an exact penalty function for nonconvex bilevel programming problem based on its KS form. Based on this exact penalty function a sufficient condition for KS to be partially calm is presented and a necessary optimality condition for nonconvex bilevel programming problems is given. Some existing results about the differentiability of the value function of the lower level programming problem are extended and a sufficient condition for CRCQ to hold for VS form of BLPP with linear lower level programming problem is also given.

关键词： Optimality conditions nonconvex bilevel programming problem exact penalty function value function constraint qualification.

CONVERGENCE PROPERTIES OF CONJUGATEGRADIENT METHODS WITH STRONG WOLFE LINESEARCH

在线全文

学校读者我要写书评

暂无评论

Systems Science and Mathematical Sciences 1998年第2期11卷 112-116页

作者： han jiye LIU Guanghui YIN Hongxia(Institute of Applied Mathematics, Academia Silica, Beijing 100080, China)

In this paper, we investigate the convergence property of the conjugate gradientalgorithms which depend on the search directionsby using different choices for the scalar oh, where 9k is the gradient of f at ac. Undersome assumptions which are slightly weaker than those in [1], we prove a global convergenceresult which allows ac to be set in a wider range than that in [1].

关键词： Conjugate gradient algorithms global convergence) unconstrained optimization.

在线全文

学校读者我要写书评

暂无评论

对称锥互补问题

数学进展 2007年第1期36卷 1-12页

作者：修乃华韩继业北京交通大学应用数学系北京100044 中国科学院数学与系统科学研究院应用数学所北京100080

对称锥互补问题是一类均衡优化,包括标准互补问题、二阶锥互补问题和半定互补问题等,近几年,人们借助欧几里德若当代数技术,在对称锥互补问题的研究方面获得了突破性进展并使之逐渐受到重视,本文主要从理论和算法两方面总结和评述这些... 详细信息

对称锥互补问题是一类均衡优化,包括标准互补问题、二阶锥互补问题和半定互补问题等,近几年,人们借助欧几里德若当代数技术,在对称锥互补问题的研究方面获得了突破性进展并使之逐渐受到重视,本文主要从理论和算法两方面总结和评述这些新成果,同时,列出了相应的重要文献。

关键词：对称锥互补问题欧几里德若当代数理论算法

A trust region algorithm for bilevel programing problems

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1998年第10期43卷 820-824页

作者： LIU Guoshan 1, han jiye 2 and WANG Shouyang 3 1. Department of Mathematics, Beijing Normal University, Beijing 100875, China 2. Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China 3. Institute of Systems Science, Chi Department of Mathematics Beijing Normal University Beijing China Institute of Applied Mathematics Chinese Academy of Sciences Beijing China Institute of Systems Science Chinese Academy of Sciences Beijing China

A trust region algorithm is proposed for solving bilevel programming problems where the lower level programming problem is a strongly convex programming problem with linear constraints. This algorithm is based on a tr... 详细信息

关键词： bilevel programming problem trust region algorithm global convergence.

一种不确定需求下库存定价模型的鲁棒优化方法

在线全文

学校读者我要写书评

暂无评论

应用数学学报 2008年第5期31卷 910-921页

作者：王英楠韩继业孙华北京交通大学应用数学系北京100044 中国科学院数学与系统科学研究院应用数学所北京100190 北京交通大学交通运输学院北京100044

本文研究了不确定需求下一种多阶段定价与库存控制相协调的供应链模型,把扰动参数的不确定性处理为在已知集合内变化扰动.针对不确定参数取值的几种集合情况下,应用鲁棒优化技术将不确定库存.定价模型转化为可求解的鲁棒模型.最后进行... 详细信息

本文研究了不确定需求下一种多阶段定价与库存控制相协调的供应链模型,把扰动参数的不确定性处理为在已知集合内变化扰动.针对不确定参数取值的几种集合情况下,应用鲁棒优化技术将不确定库存.定价模型转化为可求解的鲁棒模型.最后进行了数值实验,对结果进行了分析.

关键词：鲁棒优化不确定性供应链管理库存定价

A NEW REDUCED GRADIENT METHOD

在线全文

学校读者我要写书评

暂无评论

Science in China,Ser.A 1979年第10期 1099-1113页

作者：越民义韩继业 Institute of Mathematics Academia Sinica

In this paper we shall give a reduced gradient method and its convergence properties. The main results obtained are as follows:(ⅰ) If the objective function f is continuously differentiable, and the constraints are non-degenerate, then by starting from any feasible point, the iterative sequence {x~k} generated by the method either terminates after a finite number of iterations, or is such that every cluster point of the sequence is a K.-T. point.(ⅱ) If {x~k} is a convergent sequence, then the pivoting operations in the running of the algorithm occur only a finite number of times, i.e. after a finite number of iterations, the pivoting operation remains unchanged.(ⅲ) If the sequence {x~k} converges to x~*, which has strictly complementary slackness property,then we have x_j~k=0,for {x~k}, except for a finite number of k.(ⅳ) If f has a second continuous derivative, and its Hessian is uniformly positive definite, then {x~k} must converge to an optimal solution.

关键词： A NEW REDUCED GRADIENT METHOD

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

关于图划分问题的改进的近似算法

应用数学学报 2005年第4期28卷 587-597页

作者：徐大川韩继业杜东雷北京工业大学数理学院北京100022 中国科学院数学与系统科学研究院应用数学研究所北京100080 新布伦兹维克大学管理系

本文考虑NP-难的极大图划分(MAX-GP)问题.我们给出应用半定规划(SDP) 松弛的一个一般方法,并且给出包括极大方向割,稠密子图,极大顶点覆盖,极大割,和极大反割在内的图划分问题的改进的近似比.

关键词：图划分问题近似算法半定规划