Two-direction Subgradient Method for non-differentiable Optimization Problems
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, S | - |
| dc.contributor.author | Koh, S | - |
| dc.contributor.author | Lahn, HS | - |
| dc.date.accessioned | 2007-11-20T08:59:06Z | - |
| dc.date.available | 2007-11-20T08:59:06Z | - |
| dc.date.issued | 1981-03 | - |
| dc.identifier.citation | Operations research letters : a journal of the Operations Research Society of America, v.6 no.1, pp.43-46 | en |
| dc.identifier.issn | 0167-6377 | - |
| dc.identifier.uri | http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V8M-48MYNF3-M&_user=170364&_coverDate=03%2F31%2F1987&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000013318&_version=1&_urlVersion=0&_userid=170364&md5=77214f38cb9abdfe4d0784f00a15bd3b | - |
| dc.identifier.uri | http://hdl.handle.net/10203/2064 | - |
| dc.description.abstract | One more search direction is introduced into the subgradient method for non-differentiable optimization problems to enhance the speed of convergence. The proposed algorithm generates a point which is strictly closer and forms a more acute angle to the solution set than the point generated by the subgradient method. The resulting algorihtm still remains very simple. A computational test shows great improvement in the computational efficiency using this algorithm. | en |
| dc.language.iso | en_US | en |
| dc.publisher | Elsevier | en |
| dc.subject | Mathematical programming | en |
| dc.subject | Non differential programming | en |
| dc.subject | Non linear programming | en |
| dc.subject | Optimization | en |
| dc.subject | Cutting plane method | en |
| dc.title | Two-direction Subgradient Method for non-differentiable Optimization Problems | en |
| dc.type | Article | en |
| dc.identifier.doi | 10.1016/0167-6377(87)90008-3 | - |
- Appears in Collection
- IE-Journal Papers(저널논문)
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.