Efficiency of subgradient method in solving nonsmootth optimization problems
Nonsmooth optimization is one of the hardest type of problems to solve in optimization area. This is because of the non-differentiability of the function itself. Subgradient method is generally known as the method to solve nonsmooth optimization problems, where it was first discovered by Shor [17]....
Saved in:
主要作者: | Abdullah, Nur Azira |
---|---|
格式: | Thesis |
語言: | English |
出版: |
2014
|
主題: | |
在線閱讀: | http://eprints.utm.my/id/eprint/38863/1/NurAziraAbdullahMFS2014.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
An efficient implementation technique for implicit Runge-Kutta Gauss methods in solving mathematical stiff problems
由: Mohd Hafizul Muhammad
出版: (2018) -
A Nonlinear algorithm for solving box-constrained optimization problems
由: Mohd. Khairi, Siti Shaliza
出版: (2014) -
Overview on solving stiff problems using one-step methods
由: Tey, Kai Wean
出版: (2001) -
Aircraft sequencing problem solve by using simulated annealing method
由: Mohd. Shukor, Muhammad Fahmi
出版: (2017) -
Tabu search method for solving multiobjective job shop scheduling problem
由: Awang, Nor Fauzana
出版: (2015)