DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Sehun | ko |
dc.contributor.author | UM, BS | ko |
dc.date.accessioned | 2007-11-07T03:18:26Z | - |
dc.date.available | 2007-11-07T03:18:26Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1993-08 | - |
dc.identifier.citation | OPERATIONS RESEARCH LETTERS, v.14, no.1, pp.61 - 64 | - |
dc.identifier.issn | 0167-6377 | - |
dc.identifier.uri | http://hdl.handle.net/10203/1851 | - |
dc.description.abstract | Polyak's subgradient method for constrained nondifferentiable optimization problems is modified in one respect to improve the computational efficiency. The two consecutive projection operations in Polyak method are combined into a single projection operation. The resulting algorithm has a convergence property which is strictly stronger than that of the original Polyak method. A computational test shows significant improvement both in the number of iterations and in the CPU time. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | AN IMPROVED SUBGRADIENT METHOD FOR CONSTRAINED NONDIFFERENTIABLE OPTIMIZATION | - |
dc.type | Article | - |
dc.identifier.wosid | A1993ME29800009 | - |
dc.identifier.scopusid | 2-s2.0-38249002574 | - |
dc.type.rims | ART | - |
dc.citation.volume | 14 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 61 | - |
dc.citation.endingpage | 64 | - |
dc.citation.publicationname | OPERATIONS RESEARCH LETTERS | - |
dc.identifier.doi | 10.1016/0167-6377(93)90020-H | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Sehun | - |
dc.contributor.nonIdAuthor | UM, BS | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | NONDIFFERENTIABLE PROGRAMMING | - |
dc.subject.keywordAuthor | CONSTRAINED OPTIMIZATION | - |
dc.subject.keywordAuthor | SUBGRADIENT METHOD | - |
dc.subject.keywordAuthor | PROJECTION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.