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.
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.

Newton Method for Solving a Class of Smooth Convex Programming

  • Received Date: 2004-02-01
  • Rev Recd Date: 2005-07-12
  • Publish Date: 2005-11-15
  • 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.
  • loading
  • [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.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (2022) PDF downloads(568) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return