Proximal Minimization Methods with Generalized Bregman Functions

Authors:
Krzysztof C. Kiwiel
Affiliations:
-
Venue:
SIAM Journal on Control and Optimization
Year:
1997

Citing 0
Cited 21

Bregman Proximal Relaxation of Large-Scale 0–1 Problems

Computational Optimization and Applications
Local convergence analysis of projection-type algorithms: unified approach

Journal of Optimization Theory and Applications
Some recent advances in projection-type methods for variational inequalities

Journal of Computational and Applied Mathematics - Proceedings of the international conference on recent advances in computational mathematics
Numerical Comparison of Augmented Lagrangian Algorithms for Nonconvex Problems

Computational Optimization and Applications
Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging

Problems of Information Transmission
A proximal trust-region algorithm for column generation stabilization

Computers and Operations Research
Iterative Total Variation Regularization with Non-Quadratic Fidelity

Journal of Mathematical Imaging and Vision
A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems

Computers & Mathematics with Applications
Dual convergence of the proximal point method with Bregman distances for linear programming

Optimization Methods & Software
A generalized proximal-point-based prediction-correction method for variational inequality problems

Journal of Computational and Applied Mathematics
Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces

Computers & Mathematics with Applications
Split Bregman Algorithm, Douglas-Rachford Splitting and Frame Shrinkage

SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
A proximal trust-region algorithm for column generation stabilization

Computers and Operations Research
The Bregman distance, approximate compactness and convexity of Chebyshev sets in Banach spaces

Journal of Approximation Theory
Inexact Proximal Point Methods for Variational Inequality Problems

SIAM Journal on Optimization
Global Minimization for Continuous Multiphase Partitioning Problems Using a Dual Approach

International Journal of Computer Vision
Operator Splittings, Bregman Methods and Frame Shrinkage in Image Processing

International Journal of Computer Vision
Primal and Dual Bregman Methods with Application to Optical Nanoscopy

International Journal of Computer Vision
The CoMirror algorithm for solving nonsmooth constrained convex problems

Operations Research Letters
Mirror descent and nonlinear projected subgradient methods for convex optimization

Operations Research Letters
Higher-Order TV Methods--Enhancement via Bregman Iteration

Journal of Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider methods for minimizing a convex function f that generate a sequence {xk} by taking xk+1 to be an approximate minimizer of f(x)+Dh(x,xk)/ck, where ck 0 and Dh 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.