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]....
محفوظ في:
المؤلف الرئيسي: | Abdullah, Nur Azira |
---|---|
التنسيق: | أطروحة |
اللغة: | 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)