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

A Combined Homotopy Infeasible Interior-Point Method for Convex Nonlinear Programming
作者姓名:杨轶华  吕显瑞  刘庆怀
作者单位:School of Mathematics Jilin University Changchun,130012,School of Mathematics Jilin University,Changchun,130012,Institute of Applied Mathematics Changchun University of Technology,Changchun,130012
摘    要:In this paper, on the basis of the logarithmic barrier function and KKT conditions , we propose a combined homotopy infeasible interior-point method (CHIIP) for convex nonlinear programming problems. For any convex nonlinear programming, without strict convexity for the logarithmic barrier function, we get different solutions of the convex programming in different cases by CHIIP method.

关 键 词:凸非线性规划  非可实行内点法  同伦法  整体会聚

A Combined Homotopy Infeasible Interior-Point Method for Convex Nonlinear Programming
Institution:[1]School of Mathematics, Jilin University, Changchun, 130012 [2]Institute of Applied Mathematics, Changchun University of Technology, Changchun, 130012
Abstract:In this paper, on the basis of the logarithmic barrier function and KKT conditions , we propose a combined homotopy infeasible interior-point method (CHIIP) for convex nonlinear programming problems. For any convex nonlinear programming, without strict convexity for the logarithmic barrier function, we get different solutions of the convex programming in different cases by CHIIP method.
Keywords:convex nonlinear programming  infeasible interior point method  homotopy method  global convergence  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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