Limited memory bundle algorithm for large bound constrained nonsmooth minization problems
Published inReports of the Department of Mathematical Information Technology. Series B, Scientific computing
Typically, practical optimization problems involve nonsmooth functions of hundreds or thousands of variables. As a rule, the variables in such problems are restricted to certain meaningful intervals. In this paper, we propose an efficient adaptive limited memory bundle method for large-scale nonsmooth, possibly nonconvex, bound constrained optimization. The method combines the nonsmooth variable metric bundle method and the smooth limited memory variable metric method, while the constraint handling is based on the projected gradient method and the dual subspace minimization. The preliminary numerical experiments to be presented confirm the usability of the method.
PublisherUniversity of Jyväskylä
MetadataShow full item record
Showing items with similar title or keywords.
Karmitsa, Napsu (University of Jyväskylä, 2007)Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of hundreds or thousands of variables with various constraints. However, there exist only few large-scale academic ...
Neittaanmäki, Pekka; Tiba, Dan (Birkhäuser, 1991)We give a new approach to state constrained control problems associated to non-degenerate nonlinear parabolic equations of Stefan type. We obtain uniform estimates for the violation of the constraints.
Neittaanmäki, Pekka; Tiba, D. (University of Jyväskylä, 1986)
Nash evolutionary algorithms : Testing problem size in reconstruction problems in frame structures Greiner, D.; Periaux, Jacques; Emperador, J.M.; Galván, B.; Winter, G. (National Technical University of Athens; ECCOMAS, 2016)The use of evolutionary algorithms has been enhanced in recent years for solving real engineering problems, where the requirements of intense computational calculations are needed, especially when computational engineering ...
Paajanen, Heikki (2007)