一类光滑凸规划的牛顿法

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名

邮箱

手机号码

标题

留言内容

验证码

基金项目: 国家自然科学基金资助项目(10271073)

Newton Method for Solving a Class of Smooth Convex Programming

摘要: 给出了一个求解一类光滑凸规划的算法，利用光滑精确乘子罚函数把一个光滑凸规划的极小化问题化为一个紧集上强凸函数的极小化问题，然后在给定的紧集上用牛顿法对这个强凸函数进行极小化．
- 凸规划 /
- 牛顿法 /
- KKT乘子
Abstract: An algorithm for solving a class of smooth convex programming is given.Using smooth exact multiplier penalty function,a smooth convex programming is minimized to a minimizing strongly convex function on the compact set was reduced.Then the strongly convex function with a Newtonon method on the given compact set was minimized.
- convex programming /
- Newton method /
- KKT multiplier

[1]	Di Pillo G.Exact Penalty Methods[A].In:Spedicate E Ed.Algorithm for Continuous Optimization: The State of the Art[C].Boston: Kluwer Academic Publishers,1994,209—253.
[2]	Yu Nesterov,Nemirovsky A.Interior-Point Polynomial Methods in Convex Programming[M].America:SIAM, Philadelphia, PA, 1994,50—150.
[3]	Serge Lang.Real Analysis[M].Reading,Mass:Addison-Wesley Publisher,1983,106.
[4]	Wilkinson J H.The Algebraic Eigenvalue Problem[M].Oxford:Clarendon Press,1965.
[5]	王松桂，贯忠贞.矩阵论中不等式[M].合肥：安徽教育出版社，1994，129.
[6]	Güler O.Complexity of Smooth Convex Programming and its applications[A].In:Complexity in Numerical Optimization[C].by P M Pardalas Ed.World Scientifc Publishing Co,1993,180—202.
[7]	Bazaraa M S,Shetty C M.Nonlinear Programming-Theory and Algorithms[M].New York:John Wiley & Sons,1993,504.