首页 | 本学科首页   官方微博 | 高级检索  
     

A Fastly Convergent Directly Feasible Directions Method for Nonlinearly Inequality Constrained Optimization
引用本文:JIAN Jinbao Math. and Information Science Department,Guangxi University,Nanning530004,China. A Fastly Convergent Directly Feasible Directions Method for Nonlinearly Inequality Constrained Optimization[J]. 系统科学与系统工程学报(英文版), 1997, 0(1)
作者姓名:JIAN Jinbao Math. and Information Science Department  Guangxi University  Nanning530004  China
作者单位:JIAN Jinbao Math. and Information Science Department,Guangxi University,Nanning530004,China
摘    要:AFastlyConvergentDirectlyFeasibleDirectionsMethodforNonlinearlyInequalityConstrainedOptimizationJIANJinbaoMath.andInformatio...


A Fastly Convergent Directly Feasible Directions Method for Nonlinearly Inequality Constrained Optimization *
JIAN Jinbao Math. and Information Science Department,Guangxi University,Nanning,China. A Fastly Convergent Directly Feasible Directions Method for Nonlinearly Inequality Constrained Optimization *[J]. Journal of Systems Science and Systems Engineering, 1997, 0(1)
Authors:JIAN Jinbao Math.  Information Science Department  Guangxi University  Nanning  China
Affiliation:JIAN Jinbao Math. and Information Science Department,Guangxi University,Nanning530004,China
Abstract:In this paper, a new superlinearly convergent algorithm for nonlinearly constrained optimization problems is presented. The search directions are directly computed by a few formulas, and neither quadratic programming nor linear equation need to be sovled. Under mild assumptions, the new algorithm is shown to possess global and superlinear convergence.
Keywords:Nonlinearly constrained optimization   direct search directions   feasible directions method   global and superlinear convergence.
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号