Inny tytuł:

Raport Badawczy = Research Report ; RB/76/2002

Wydawca:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Miejsce wydania:

Warszawa

Opis:

26 pages ; 21 cm ; Bibliography p. 23-25

Abstrakt:

The paper addresses the useful properties of ballstep subgradient methods for convex optimization that use 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, theyfind both primal and dual solutions, and have practicable stopping criteria. Up till now, similar results have only been known for proximal bundle methods, and for subgradient methods with divergent series stepsizes, whose convergence can be słow. Encouraging numerical results arepresented for large-scale nonlinear multicommodity network flow problems.

Czasopismo/Seria/cykl:

Raport Badawczy = Research Report

Szczegółowy typ zasobu:

Report

Identyfikator zasobu:

oai:rcin.org.pl:139438

Źródło:

RB-2002-76

Język:

eng

Język streszczenia:

eng

Prawa:

Creative Commons Attribution BY 4.0 license

Zasady wykorzystania:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitalizacja:

Systems Research Institute of the Polish Academy of Sciences

Lokalizacja oryginału:

Library of Systems Research Institute PAS

Dofinansowane ze środków:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Dostęp:

Open