Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1054.90053
Hintermüller, Michael
A proximal bundle method based on approximate subgradients. (English)
[J] Comput. Optim. Appl. 20, No. 3, 245-266 (2001). ISSN 0926-6003; ISSN 1573-2894/e

Summary: A proximal bundle method is introduced that is capable to deal with approximate subgradients. No further knowledge of the approximation quality (like explicit knowledge or controllability of error bounds) is required for proving convergence. It is shown that every accumulation point of the sequence of iterates generated by the proposed algorithm is a well-defined approximate solution of the exact minimization problem. In the case of exact subgradients the algorithm behaves like well-established proximal bundle methods. Numerical tests emphasize the theoretical findings.

MSC 2000:: *90C25 Convex programming
49J52 Nonsmooth analysis (other weak concepts of optimality)

Keywords: approximate subgradient; convex programming; nonsmooth optimization; proximal bundle method

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]