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


Levitin–Polyak well-posedness of constrained vector optimization problems
Authors:X X Huang  X Q Yang
Institution:(1) School of Management, Fudan University, Shanghai, 200433, China;(2) Department of Applied Mathematics, The Hong Kong Polytechnic University, Kowloon, Hong Kong
Abstract:In this paper, we consider Levitin–Polyak type well-posedness for a general constrained vector optimization problem. We introduce several types of (generalized) Levitin–Polyak well-posednesses. Criteria and characterizations for these types of well-posednesses are given. Relations among these types of well-posedness are investigated. Finally, we consider convergence of a class of penalty methods under the assumption of a type of generalized Levitin–Polyak well-posedness.
Keywords:Constrained vector optimization  Minimizing sequence  (generalized) Levitin–  Polyak well-posedness  Penalty type methods
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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