Convex optimization : theory, methods and applications
著者
書誌事項
Convex optimization : theory, methods and applications
(Mathematics research developments series)
Nova Science Publishers, c2019
大学図書館所蔵 全1件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
Over the past two decades, it has been recognized that advanced image processing techniques provide valuable information to physicians for the diagnosis, image guided therapy and surgery, and monitoring of human diseases. This book introduces novel and sophisticated mathematical problems which encourage the development of advanced optimisation and computing methods, especially convex optimisation. The authors go on to study Steffensen-King-type methods of convergence to approximate a locally unique solution of a nonlinear equation and also in problems of convex optimisation. Real-world applications are also provided. The following study is focused on the design and testing of a Matlab code of the Frank-Wolfe algorithm. The Nesterov step is proposed in order to accelerate the algorithm, and the results of some numerical experiments of constraint optimization are also provided. Lagrangian methods for numerical solutions to constrained convex programs are also explored. For enhanced algorithms, the traditional Lagrange multiplier update is modified to take a soft reflection across the zero boundary. This, coupled with a modified drift expression, is shown to yield improved performance. Next, Newtons mesh independence principle was used to solve a certain class of optimal design problems from earlier studies. Motivated by optimization considerations, the authors show that under the same computational cost, a finer mesh independence principle can be given than before. This compilation closes with a presentation on a local convergence analysis for eighthorder variants of HansenPatricks family for approximating a locally unique solution of a nonlinear equation. The radius of convergence and computable error bounds on the distances involved are also provided.
「Nielsen BookData」 より