DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Sehun | ko |
dc.contributor.author | Chang, KN | ko |
dc.contributor.author | Lee, JY | ko |
dc.date.accessioned | 2007-11-07T02:28:08Z | - |
dc.date.available | 2007-11-07T02:28:08Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1995-11 | - |
dc.identifier.citation | MATHEMATICAL PROGRAMMING, v.71, no.1, pp.17 - 28 | - |
dc.identifier.issn | 0025-5610 | - |
dc.identifier.uri | http://hdl.handle.net/10203/1848 | - |
dc.description.abstract | Most of the descent methods developed so far suffer from the computational burden due to a sequence of constrained quadratic subproblems which are needed to obtain a descent direction. In this paper we present a class of proximal-type descent methods with a new direction-finding subproblem. Especially, two of them have a linear programming subproblem instead of a quadratic subproblem. Computational experience of these two methods has been performed on two well-known test problems. The results show that these methods are another very promising approach for nondifferentiable convex optimization. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | SUBGRADIENT METHOD | - |
dc.subject | MINIMIZATION | - |
dc.subject | ALGORITHM | - |
dc.title | A descent method with linear programming subproblems for nondifferentiable convex optimization | - |
dc.type | Article | - |
dc.identifier.wosid | A1995TK80100002 | - |
dc.identifier.scopusid | 2-s2.0-0029184252 | - |
dc.type.rims | ART | - |
dc.citation.volume | 71 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 17 | - |
dc.citation.endingpage | 28 | - |
dc.citation.publicationname | MATHEMATICAL PROGRAMMING | - |
dc.identifier.doi | 10.1007/BF01592242 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Sehun | - |
dc.contributor.nonIdAuthor | Chang, KN | - |
dc.contributor.nonIdAuthor | Lee, JY | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | descent method | - |
dc.subject.keywordAuthor | proximal algorithm | - |
dc.subject.keywordAuthor | direction-finding subproblem | - |
dc.subject.keywordPlus | SUBGRADIENT METHOD | - |
dc.subject.keywordPlus | MINIMIZATION | - |
dc.subject.keywordPlus | ALGORITHM | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.