VARIABLE TARGET VALUE SUBGRADIENT METHOD

Cited 36 time in webofscience Cited 0 time in scopus
  • Hit : 915
  • Download : 26
Polyak's subgradient algorithm for nondifferentiable optimization problems requires prior knowledge of the optimal value of the objective function to find an optimal solution. In this paper we extend the convergence properties of the Polyak's subgradient algorithm with a fixed target value to a more general case with variable target values. Then a target value updating scheme is provided which finds an optimal solution without prior knowledge of the optimal objective value. The convergence proof of the scheme is provided and computational results of the scheme are reported.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1991-01
Language
English
Article Type
Article
Keywords

OPTIMIZATION

Citation

MATHEMATICAL PROGRAMMING, v.49, no.3, pp.359 - 369

ISSN
0025-5610
URI
http://hdl.handle.net/10203/2059
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 36 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0