Sökning: id:"swepub:oai:DiVA.org:liu-40001" >
Lagrangian relaxati...
Lagrangian relaxation via ballstep subgradient methods
-
- Kiwiel, Krzysztof C. (författare)
- Systems Research Institute, Warszawa
-
- Larsson, Torbjörn, 1957- (författare)
- Linköpings universitet,Tekniska högskolan,Optimeringslära
-
- Lindberg, Per Olov, 1942- (författare)
- Linköpings universitet,Tekniska högskolan,Optimeringslära
-
(creator_code:org_t)
- Institute for Operations Research and the Management Sciences (INFORMS), 2007
- 2007
- Engelska.
-
Ingår i: Mathematics of Operations Research. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0364-765X .- 1526-5471. ; 32:3, s. 669-686
- Relaterad länk:
-
http://rcin.org.pl/C...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We exhibit useful properties of ballstep subgradient methods for convex optimization using level controls for estimating the optimal value. Augmented with simple averaging schemes, they asymptotically find objective and constraint subgradients involved in optimality conditions. When applied to Lagrangian relaxation of convex programs, they find both primal and dual solutions, and have practicable stopping criteria. Up until now, similar results have only been known for proximal bundle methods, and for subgradient methods with divergent series stepsizes, whose convergence can be slow. Encouraging numerical results are presented for large-scale nonlinear multicommodity network flow problems. ©2007 INFORMS.
Ämnesord
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Nyckelord
- MATHEMATICS
- MATEMATIK
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas