Pages that link to "Item:Q3140001"
From MaRDI portal
The following pages link to Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions (Q3140001):
Displaying 50 items.
- Solving variational inequalities with monotone operators on domains given by linear minimization oracles (Q263192) (← links)
- Hybrid iterative algorithm for finite families of countable Bregman quasi-Lipschitz mappings with applications in Banach spaces (Q264930) (← links)
- A proximal method with logarithmic barrier for nonlinear complementarity problems (Q280087) (← links)
- New hybrid shrinking projection algorithm for common fixed points of a family of countable quasi-Bregman strictly pseudocontractive mappings with equilibrium and variational inequality and optimization problems (Q286583) (← links)
- A strong convergence theorem for Bregman asymptotically quasi-nonexpansive mappings in the intermediate sense (Q286908) (← links)
- Strong convergence theorems for Bregman \(W\)-mappings with applications to convex feasibility problems in Banach spaces (Q288039) (← links)
- Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces (Q288117) (← links)
- Sparsity regularization of the diffusion coefficient identification problem: well-posedness and convergence rates (Q310729) (← links)
- On the ergodic convergence rates of a first-order primal-dual algorithm (Q312675) (← links)
- An inexact proximal method for quasiconvex minimization (Q319853) (← links)
- A weighted mirror descent algorithm for nonsmooth convex optimization problem (Q328453) (← links)
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant (Q421699) (← links)
- Interior proximal methods for quasiconvex optimization (Q427358) (← links)
- Convergence of a proximal point algorithm for solving minimization problems (Q442796) (← links)
- A first order method for finding minimal norm-like solutions of convex optimization problems (Q463716) (← links)
- An alternating extragradient method with non Euclidean projections for saddle point problems (Q480931) (← links)
- Dual subgradient algorithms for large-scale nonsmooth learning problems (Q484132) (← links)
- Interior proximal method without the cutting plane property (Q493039) (← links)
- Convergence of a proximal-like algorithm in the presence of computational errors (Q536466) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- The CoMirror algorithm for solving nonsmooth constrained convex problems (Q614018) (← links)
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming (Q616787) (← links)
- Split Bregman method for the modified lot model in image denoising (Q628889) (← links)
- An interior proximal method in vector optimization (Q635150) (← links)
- A unified primal-dual algorithm framework based on Bregman iteration (Q639393) (← links)
- Logarithmic quasi-distance proximal point scalarization method for multi-objective programming (Q668555) (← links)
- On the convergence of the exponential multiplier method for convex programming (Q688911) (← links)
- On a generalized proximal point method for solving equilibrium problems in Banach spaces (Q714471) (← links)
- Compositions and convex combinations of Bregman weakly relatively nonexpansive operators in reflexive Banach spaces (Q780434) (← links)
- Proximal methods in reflexive Banach spaces without monotonicity (Q874955) (← links)
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming (Q925232) (← links)
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming (Q937140) (← links)
- A generalized proximal-point-based prediction-correction method for variational inequality problems (Q950089) (← links)
- Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces (Q971618) (← links)
- Klee sets and Chebyshev centers for the right Bregman distance (Q979041) (← links)
- Interior proximal methods and central paths for convex second-order cone programming (Q992842) (← links)
- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds (Q1014028) (← links)
- Primal-dual proximal point algorithm for linearly constrained convex programming problems (Q1203067) (← links)
- Progressive regularization of variational inequalities and decomposition algorithms (Q1265010) (← links)
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators (Q1290609) (← links)
- Approximate iterations in Bregman-function-based proximal algorithms (Q1290655) (← links)
- Proximal minimization algorithm with \(D\)-functions (Q1321192) (← links)
- An interior point method for the nonlinear complementarity problem (Q1369440) (← links)
- Equilibrium programming using proximal-like algorithms (Q1373724) (← links)
- Generalized Bregman projections in convex feasibility problems (Q1384057) (← links)
- Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) (← links)
- On some properties of generalized proximal point methods for variational inequalities (Q1389080) (← links)
- Approximation of linear programs by Bregman's \(D_F\) projections (Q1584816) (← links)
- A simplified view of first order methods for optimization (Q1650767) (← links)
