Polyaks subgradient method with simplified projection for nondifferentiable optimization with linear constraints
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, Sehun | ko |
| dc.contributor.author | Bong-Sik Um | ko |
| dc.date.accessioned | 2013-02-25T03:59:59Z | - |
| dc.date.available | 2013-02-25T03:59:59Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1989 | - |
| dc.identifier.citation | OPTIMIZATION, v.20, no.4, pp.451 - 456 | - |
| dc.identifier.issn | 0233-1934 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/59687 | - |
| dc.description.abstract | The projection operation required in the Polyaks subgradient method for nondifferentiable optimization problems with linear constraints is simplified. The modified method finds a new search direction in the cone of feasible directions at the current point. This greatly reduces the dimension of the projection operation. A computational test shows significant improvement in the computational efficiency. | - |
| dc.language | English | - |
| dc.publisher | Taylor & Francis Ltd | - |
| dc.title | Polyaks subgradient method with simplified projection for nondifferentiable optimization with linear constraints | - |
| dc.type | Article | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 20 | - |
| dc.citation.issue | 4 | - |
| dc.citation.beginningpage | 451 | - |
| dc.citation.endingpage | 456 | - |
| dc.citation.publicationname | OPTIMIZATION | - |
| dc.contributor.localauthor | Kim, Sehun | - |
| dc.contributor.nonIdAuthor | Bong-Sik Um | - |
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.