eprintid: 4568
rev_number: 20
eprint_status: archive
userid: 351
dir: disk0/00/00/45/68
datestamp: 2016-01-15 02:06:20
lastmod: 2021-08-27 17:15:22
status_changed: 2016-01-15 02:06:20
type: monograph
metadata_visibility: show
item_issues_count: 2
creators_name: Kiwiel, K.
title: Proximal Minimization Methods with Generalized Bregman Functions
ispublished: pub
internal_subjects: iis_met
internal_subjects: iis_sys
divisions: prog_opt
abstract: We consider methods for minimizing a convex function $f$ that generate a sequence ${x^k}$ by taking $x^{k+1}$ to be an approximate minimizer of $f(x)+D_h(x,x^k)/c_k$, where $c_k>0$ and $D_h$ is the $D$-function of a Bregman function $h$.  Extensions are made to $B$-functions that generalize Bregman functions and cover more applications.  Convergence is established under criteria amenable to implementation. Applications are made to nonquadratic multiplier methods for nonlinear programs.
date: 1995-03
date_type: published
publisher: WP-95-024
iiasapubid: WP-95-024
price: 10
full_text_status: public
monograph_type: working_paper
place_of_pub: IIASA, Laxenburg, Austria
pages: 30
coversheets_dirty: FALSE
fp7_type: info:eu-repo/semantics/book
citation:   Kiwiel, K.  (1995).  Proximal Minimization Methods with Generalized Bregman Functions.   IIASA Working Paper. IIASA, Laxenburg, Austria: WP-95-024     
document_url: https://pure.iiasa.ac.at/id/eprint/4568/1/WP-95-024.pdf