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


Nonlinear Lagrangian Theory for Nonconvex Optimization
Authors:Goh  C J  Yang  X Q
Institution:(1) Department of Mathematics, Chongqing Normal University, Chongqing, People’ Republic of China;(2) Department of Applied Mathematics, University of New South Wales, Sydney, Australia;(3) School of Information Technology and Mathematical Sciences, University of Ballarat, Ballarat, Victoria, Australia;
Abstract:The Lagrangian function in the conventional theory for solving constrained optimization problems is a linear combination of the cost and constraint functions. Typically, the optimality conditions based on linear Lagrangian theory are either necessary or sufficient, but not both unless the underlying cost and constraint functions are also convex.We propose a somewhat different approach for solving a nonconvex inequality constrained optimization problem based on a nonlinear Lagrangian function. This leads to optimality conditions which are both sufficient and necessary, without any convexity assumption. Subsequently, under appropriate assumptions, the optimality conditions derived from the new nonlinear Lagrangian approach are used to obtain an equivalent root-finding problem. By appropriately defining a dual optimization problem and an alternative dual problem, we show that zero duality gap will hold always regardless of convexity, contrary to the case of linear Lagrangian duality.
Keywords:inequality constraints  nonlinear Lagrangian  nonconvex optimization  sufficient and necessary conditions  zero duality gap
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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