DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Sehun | ko |
dc.contributor.author | AHN, H | ko |
dc.date.accessioned | 2007-11-20T07:44:57Z | - |
dc.date.available | 2007-11-20T07:44:57Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1991-03 | - |
dc.identifier.citation | MATHEMATICAL PROGRAMMING, v.50, no.1, pp.75 - 80 | - |
dc.identifier.issn | 0025-5610 | - |
dc.identifier.uri | http://hdl.handle.net/10203/2058 | - |
dc.description.abstract | A generalized subgradient method is considered which uses the subgradients at previous iterations as well as the subgradient at current point. This method is a direct generalization of the usual subgradient method. We provide two sets of convergence conditions of the generalized subgradient method. Our results provide a larger class of sequences which converge to a minimum point and more freedom of adjustment to accelerate the speed of convergence. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | CONVERGENCE OF A GENERALIZED SUBGRADIENT METHOD FOR NONDIFFERENTIABLE CONVEX-OPTIMIZATION | - |
dc.type | Article | - |
dc.identifier.wosid | A1991FE73200004 | - |
dc.identifier.scopusid | 2-s2.0-0026116722 | - |
dc.type.rims | ART | - |
dc.citation.volume | 50 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 75 | - |
dc.citation.endingpage | 80 | - |
dc.citation.publicationname | MATHEMATICAL PROGRAMMING | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Sehun | - |
dc.contributor.nonIdAuthor | AHN, H | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | SUBGRADIENT METHOD | - |
dc.subject.keywordAuthor | EPSILON-SUBGRADIENT | - |
dc.subject.keywordAuthor | NONDIFFERENTIABLE OPTIMIZATION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.