Citation: | YAO Yi-rong, ZHANG Lian-sheng, HAN Bo-shun. Newton Method for Solving a Class of Smooth Convex Programming[J]. Applied Mathematics and Mechanics, 2005, 26(11): 1351-1358. |
[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.
|