Proximal Minimization Methods with Generalized Bregman Functions
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- 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 bundle Bregman proximal method for convex nondifferentiable minimization
- Proximal minimization algorithm with \(D\)-functions
- Generalized Bregman projections in convex feasibility problems
- Subgradient method with entropic projections for convex nondifferentiable minimization
- A practical general approximation criterion for methods of multipliers based on Bregman distances
- Nonlinear proximal decomposition method for convex programming
- On Bregman-type distances for convex functions and maximally monotone operators
- Mini-workshop: Deep learning and inverse problems. Abstracts from the mini-workshop held March 4--10, 2018
- A primal-dual proximal point algorithm for constrained convex programs
- An optimal randomized incremental gradient method
- Local convergence analysis of projection-type algorithms: unified approach
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Some recent advances in projection-type methods for variational inequalities
- Entropy programming modeling of IBNR claims reserves
- Higher-order TV methods -- enhancement via Bregman iteration
- An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds
- Linearized Krylov subspace Bregman iteration with nonnegativity constraint
- A dual Bregman proximal gradient method for relatively-strongly convex optimization
- 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
- Bregman Itoh-Abe methods for sparse optimisation
- On the determination of missing boundary data for solids with nonlinear material behaviors, using displacement fields measured on a part of their boundaries
- An adaptive primal-dual framework for nonsmooth convex minimization
- Generalized Bregman envelopes and proximity operators
- A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds
- Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity
- On a Bregman regularized proximal point method for solving equilibrium problems
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
- Iterative total variation regularization with non-quadratic fidelity
- Recursive aggregation of estimators by the mirror descent algorithm with averaging
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- 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
- Iterative choice of the optimal regularization parameter in TV image restoration
- A proximal trust-region algorithm for column generation stabilization
- On finite convergence of proximal point algorithms for variational inequalities
- Strong convergence theorems for equilibrium problems and weak Bregman relatively nonexpansive mappings in Banach spaces
- A proximal ADMM with the Broyden family for convex optimization problems
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Dykstras algorithm with bregman projections: A convergence proof
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- On dual convergence of the generalized proximal point method with Bregman distances
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES
- A proximal point algorithm with a -divergence for quasiconvex programming
- A proximal multiplier method for separable convex minimization
- A proximal method with logarithmic barrier for nonlinear complementarity problems
- Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces
- Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities
- Generalized proximal point algorithms for multiobjective optimization problems
- Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
- Sparsity regularization of the diffusion coefficient identification problem: well-posedness and convergence rates
- Gradient sliding for composite optimization
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- A proximal algorithm with quasi distance. Application to habit's formation
- Proximal Methods with Penalization Effects in Banach Spaces
- An inexact proximal method for quasiconvex minimization
- A weighted mirror descent algorithm for nonsmooth convex optimization problem
- Joint phase reconstruction and magnitude segmentation from velocity-encoded MRI data
- scientific article; zbMATH DE number 5077050 (Why is no real title available?)
- Entropic approximation of Wasserstein gradient flows
- Reconstructing conductivity coefficients based on sparsity regularization and measured data in electrical impedance tomography
- Solution of nonlinear Cauchy problem for hyperelastic solids
- 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
- An optimal method for stochastic composite optimization
- scientific article; zbMATH DE number 1070393 (Why is no real title available?)
- Modified Lagrangian methods for separable optimization problems
- scientific article; zbMATH DE number 1968261 (Why is no real title available?)
- Convergence of a proximal point algorithm for solving minimization problems
- Finite convergence of a projected proximal point algorithm for the generalized variational inequalities
- Regularizing with Bregman-Moreau envelopes
- Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming
- Re-examination of Bregman functions and new properties of their divergences
- Random gradient extrapolation for distributed and stochastic optimization
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Variational image segmentation models involving non-smooth data-fidelity terms
- Survey of Bundle Methods for Nonsmooth Optimization
- Extended auxiliary problem principle to variational inequalities involving multi-valued operators
- The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
- Exponential augmented Lagrangian methods for equilibrium problems
- Linear and superlinear convergence of an inexact algorithm with proximal distances for variational inequality problems
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
- On the linear convergence of a Bregman proximal point algorithm
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- Determining two coefficients in diffuse optical tomography with incomplete and noisy Cauchy data
- The Generalized Bregman Distance
- 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
- Bregman functions and auxiliary problem principle
- A modified Bregman proximal scheme to minimize the difference of two convex functions
- scientific article; zbMATH DE number 2221962 (Why is no real title available?)
- An introduction to continuous optimization for imaging
This page was built for publication: Proximal Minimization Methods with Generalized Bregman Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377388)
