Object

Title: A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization

Creator:

Kiwiel, Krzysztof. Autor

Date issued/created:

2007

Resource type:

Tekst

Subtitle:

Raport Badawczy = Research Report ; RB/71/2007

Publisher:

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

Place of publishing:

Warszawa

Description:

23 pages ; 21 cm ; Bibliography p. 22-23

Abstract:

We give a proximal bundle method for constrained convex optimization. It requires only evaluating the problem functions and their subgradients with an unkown accuracy ε. Employing a combination of the classic method of centers' improvement function with an exact penalty function, it does not need a feasible starting point. It asymptotically finds points with at least ε-optimal objective values that are ε-feasible. When applied to the solution of linear programming problems via column generation, it allows for ε-accurate solutions of column generation subproblems.

Relation:

Raport Badawczy = Research Report

Detailed Resource Type:

Report

Resource Identifier:

oai:rcin.org.pl:139758

Source:

RB-2007-71

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

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: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

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.

×

Citation

Citation style:

This page uses 'cookies'. More information