Proximal Minimization Methods with Generalized Bregman Functions
From MaRDI portal
Publication:4377388
DOI10.1137/S0363012995281742zbMath0890.65061OpenAlexW2067272684MaRDI QIDQ4377388
Publication date: 9 February 1998
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0363012995281742
convergenceconvex programmingnondifferentiable optimizationproximal methodsBregman functions\(B\)-functionsnonquadratic multiplier methods
Related Items (only showing first 100 items - show all)
Variational regularization in inverse problems and machine learning ⋮ Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence ⋮ The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis ⋮ Bregman proximal point type algorithms for quasiconvex minimization ⋮ Some recent advances in projection-type methods for variational inequalities ⋮ The proximal point method with a vectorial Bregman regularization in multiobjective DC programming ⋮ Proximal Methods with Penalization Effects in Banach Spaces ⋮ Exponential augmented Lagrangian methods for equilibrium problems ⋮ A proximal method with logarithmic barrier for nonlinear complementarity problems ⋮ Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces ⋮ Sparsity regularization of the diffusion coefficient identification problem: well-posedness and convergence rates ⋮ Entropic Approximation of Wasserstein Gradient Flows ⋮ Gradient sliding for composite optimization ⋮ Survey of Bundle Methods for Nonsmooth Optimization ⋮ Reconstructing conductivity coefficients based on sparsity regularization and measured data in electrical impedance tomography ⋮ Revisiting linearized Bregman iterations under Lipschitz-like convexity condition ⋮ Solution of nonlinear Cauchy problem for hyperelastic solids ⋮ Strong convergence theorems for equilibrium problems and weak Bregman relatively nonexpansive mappings in Banach spaces ⋮ An inexact proximal method for quasiconvex minimization ⋮ Iterative total variation regularization with non-quadratic fidelity ⋮ A weighted mirror descent algorithm for nonsmooth convex optimization problem ⋮ On Bregman-type distances for convex functions and maximally monotone operators ⋮ Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems ⋮ The developments of proximal point algorithms ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ Extended auxiliary problem principle to variational inequalities involving multi-valued operators ⋮ Regularizing with Bregman--Moreau Envelopes ⋮ Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming ⋮ On the linear convergence of a Bregman proximal point algorithm ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ Generalized Bregman projections in convex feasibility problems ⋮ Subgradient method with entropic projections for convex nondifferentiable minimization ⋮ Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant ⋮ The CoMirror algorithm for solving nonsmooth constrained convex problems ⋮ Entropy programming modeling of IBNR claims reserves ⋮ An inexact scalarization proximal point method for multiobjective quasiconvex minimization ⋮ Global minimization for continuous multiphase partitioning problems using a dual approach ⋮ Primal and dual Bregman methods with application to optical nanoscopy ⋮ Operator splittings, Bregman methods and frame shrinkage in image processing ⋮ An extension of proximal methods for quasiconvex minimization on the nonnegative orthant ⋮ Higher-order TV methods -- enhancement via Bregman iteration ⋮ An optimal method for stochastic composite optimization ⋮ Recursive aggregation of estimators by the mirror descent algorithm with averaging ⋮ An interior proximal method in vector optimization ⋮ Bregman Itoh-Abe methods for sparse optimisation ⋮ Approximation of fixed points of weak Bregman relatively nonexpansive mappings in Banach spaces ⋮ Modified Lagrangian methods for separable optimization problems ⋮ Convergence of a proximal point algorithm for solving minimization problems ⋮ On the determination of missing boundary data for solids with nonlinear material behaviors, using displacement fields measured on a part of their boundaries ⋮ Determining two coefficients in diffuse optical tomography with incomplete and noisy Cauchy data ⋮ An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ Finite convergence of a projected proximal point algorithm for the generalized variational inequalities ⋮ Dykstras algorithm with bregman projections: A convergence proof ⋮ Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming ⋮ An adaptive primal-dual framework for nonsmooth convex minimization ⋮ Variational image segmentation models involving non-smooth data-fidelity terms ⋮ Convergence rates for total variation regularization of coefficient identification problems in elliptic equations. II ⋮ Mini-workshop: Deep learning and inverse problems. Abstracts from the mini-workshop held March 4--10, 2018 ⋮ Proximal-like algorithm using the quasi D-function for convex second-order cone programming ⋮ Generalized Bregman envelopes and proximity operators ⋮ The Generalized Bregman Distance ⋮ Unnamed Item ⋮ Generalized proximal point algorithms for multiobjective optimization problems ⋮ A generalized proximal-point-based prediction-correction method for variational inequality problems ⋮ Some convex programs without a duality gap ⋮ A primal-dual proximal point algorithm for constrained convex programs ⋮ An introduction to continuous optimization for imaging ⋮ Numerical comparison of augmented Lagrangian algorithms for nonconvex problems ⋮ Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces ⋮ INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES ⋮ Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization. ⋮ A proximal-point SQP trust region method for solving some special class of nonlinear semi-definite programming problems ⋮ Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces ⋮ The Bregman distance, approximate compactness and convexity of Chebyshev sets in Banach spaces ⋮ On a generalized proximal point method for solving equilibrium problems in Banach spaces ⋮ A proximal point algorithm with a ϕ-divergence for quasiconvex programming ⋮ Dual convergence of the proximal point method with Bregman distances for linear programming ⋮ A new accuracy criterion for approximate proximal point algorithms ⋮ A proximal multiplier method for separable convex minimization ⋮ An optimal randomized incremental gradient method ⋮ Random Gradient Extrapolation for Distributed and Stochastic Optimization ⋮ Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming ⋮ Linearized Krylov subspace Bregman iteration with nonnegativity constraint ⋮ A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds ⋮ Joint Phase Reconstruction and Magnitude Segmentation from Velocity-Encoded MRI Data ⋮ Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity ⋮ Local convergence analysis of projection-type algorithms: unified approach ⋮ Mirror descent and nonlinear projected subgradient methods for convex optimization. ⋮ On a Bregman regularized proximal point method for solving equilibrium problems ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels ⋮ Modern regularization methods for inverse problems ⋮ Bregman distances without coercive condition: suns, Chebyshev sets and Klee sets ⋮ A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems ⋮ A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant ⋮ Approximate iterations in Bregman-function-based proximal algorithms ⋮ A proximal trust-region algorithm for column generation stabilization ⋮ On finite convergence of proximal point algorithms for variational inequalities ⋮ On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators ⋮ Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework
This page was built for publication: Proximal Minimization Methods with Generalized Bregman Functions
