Home > Papers

 
 
A Constraint Shifting Combined Homotopy Method For Solving Nonlinear Nonconvex Programming
Wang Xiuyu 1,Jiang Xingwu 2,Liu Qinghuai 1 *
1.School of Basic Science,Changchun University of Technology ,Changchun 130012
2.Jilin Business and Technology College,Changchun 130062
*Correspondence author
#Submitted by
Subject:
Funding: 国家自然科学基金,吉林省教育厅十一五科学技术研究项目（No.10771020,）
Opened online: 4 February 2009
Accepted by: none
Citation: Wang Xiuyu,Jiang Xingwu,Liu Qinghuai.A Constraint Shifting Combined Homotopy Method For Solving Nonlinear Nonconvex Programming[OL]. [ 4 February 2009] http://en.paper.edu.cn/en_releasepaper/content/28389
 
 
For solving nonlinear nonconvex programming problem,we construct constraint shifting functios with a parameter and a combined homotopy equation. We just need the feasible filed be bounded connected and the regularity of boundary.The convergence of a smooth homotopy path that from any interior point or any infeasible interior point to a solution of the problem is proved.Numerical examples conclued that this method is feasible and effective.
Keywords:nonlinear programming;nonconvex programming;combined homotopy;constraint shifting
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 299
Bookmarked 0
Recommend 5
Comments Array
Submit your papers