首页 | 官方网站   微博 | 高级检索  
     

结合罚函数与序列二次规划的[lp]范数优化方法
引用本文:马 聪,刘 哲,甄小仙.结合罚函数与序列二次规划的[lp]范数优化方法[J].计算机工程与应用,2013,49(18):212-216.
作者姓名:马 聪  刘 哲  甄小仙
作者单位:西北工业大学 理学院,西安 710129
摘    要:结合罚函数法与序列二次规划(SQP)方法研究了lp]范数优化的求解算法。分析了基于SQP方法的lp]范数优化算法,探讨了初值选取对算法收敛性的影响;针对SQP方法受迭代初值的限制,引入罚函数优化方法对迭代初值作预估计,使其进入可行域,采用SQP方法求解计算。实验结果表明,结合罚函数与SQP方法的lp]范数优化算法对稀疏信号有较优的重构效果。

关 键 词:罚函数  序列二次规划  [lp]范数  稀疏信号  

Combining penalty function with sequential quadratic programming method for [lp] norm minimization
MA Cong,LIU Zhe,ZHEN Xiaoxian.Combining penalty function with sequential quadratic programming method for [lp] norm minimization[J].Computer Engineering and Applications,2013,49(18):212-216.
Authors:MA Cong  LIU Zhe  ZHEN Xiaoxian
Affiliation:School of Science, Northwestern Polytechnical University, Xi’an 710129, China
Abstract:A new approach is proposed for the lp] norm optimization problem by combining the Sequential Quadratic Programming(SQP) method and penalty function method. Since the initial value influences the convergence of SQP method, the penalty function is introduced to generate the feasible initial value and then solve the problem with SQP method. Numerical results show that the proposed algorithm has good performance on sparse signal reconstruction.
Keywords:penalty function  sequential quadratic programming  [lp] norm  sparse signal  
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号