Pages that link to "Item:Q3140001"

The following pages link to Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions (Q3140001):

Displaying 50 items.

• Proximal gradient methods for multiobjective optimization and their applications (Q2419509) (← links)
• A simple convergence analysis of Bregman proximal gradient algorithm (Q2419573) (← links)
• Non-smooth non-convex Bregman minimization: unification and new algorithms (Q2420780) (← links)
• Approximating common fixed points of Bregman weakly relatively nonexpansive mappings in Banach spaces (Q2443813) (← links)
• On the existence and convergence of approximate solutions for equilibrium problems in Banach spaces (Q2471908) (← links)
• Approximate proximal algorithms for generalized variational inequalities with pseudomonotone multifunctions (Q2479349) (← links)
• Interior projection-like methods for monotone variational inequalities (Q2570999) (← links)
• A proximal trust-region algorithm for column generation stabilization (Q2571184) (← links)
• A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
• An inexact scalarization proximal point method for multiobjective quasiconvex minimization (Q2675734) (← links)
• Perturbed Fenchel duality and first-order methods (Q2687051) (← links)
• Bregman three-operator splitting methods (Q2696977) (← links)
• Event-triggered distributed online convex optimization with delayed bandit feedback (Q2698149) (← links)
• An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems (Q2701420) (← links)
• Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
• INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES (Q2769521) (← links)
• A proximal point algorithm with a ϕ-divergence for quasiconvex programming (Q2786322) (← links)
• Convergence theorem for equilibrium problem and Bregman strongly nonexpansive mappings in Banach spaces (Q2790879) (← links)
• A proximal multiplier method for separable convex minimization (Q2790892) (← links)
• Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
• Coordinate descent with arbitrary sampling I: algorithms and complexity^† (Q2829565) (← links)
• Interior proximal methods for equilibrium programming: part I (Q2868931) (← links)
• The Legendre Transformation in Modern Optimization (Q2957720) (← links)
• Generalized proximal point algorithms for multiobjective optimization problems (Q3006689) (← links)
• Proximal Methods with Penalization Effects in Banach Spaces (Q3157819) (← links)
• Interior proximal extragradient method for equilibrium problems (Q3454860) (← links)
• Reconstructing conductivity coefficients based on sparsity regularization and measured data in electrical impedance tomography (Q3456559) (← links)
• A derivative-free comirror algorithm for convex optimization (Q3458813) (← links)
• A BREGMAN ITERATIVE REGULARIZATION METHOD FOR WAVELET-BASED IMAGE DEBLURRING (Q3569321) (← links)
• A new family of penalties for augmented Lagrangian methods (Q3588894) (← links)
• The perturbed generalized proximal point algorithm (Q3839561) (← links)
• Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization (Q4351184) (← links)
• Newton-type Methods with Generalized Distances For Constrained Optimization (Q4361042) (← links)
• On a proximal point method for convex optimization in banach spaces (Q4385279) (← links)
• An Extension of the Auxiliary Problem Principle to Nonsymmetric Auxiliary Operators (Q4386660) (← links)
• Regularizing with Bregman--Moreau Envelopes (Q4561226) (← links)
• First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems (Q4577742) (← links)
• On the Convergence of Gradient-Like Flows with Noisy Gradient Input (Q4602552) (← links)
• Re-examination of Bregman functions and new properties of their divergences (Q4613995) (← links)
• Singular Riemannian barrier methods and gradient-projection dynamical systems for constrained optimization (Q4669783) (← links)
• Non-Convex feasibility problems and proximal point methods (Q4673320) (← links)
• Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions (Q4991666) (← links)
• The split common null point problem for Bregman generalized resolvents in two Banach spaces (Q5009165) (← links)
• Strong convergence of Halpern iteration for products of finitely many resolvents of maximal monotone operators in Banach spaces (Q5020909) (← links)
• The proximal point method with a vectorial Bregman regularization in multiobjective DC programming (Q5034939) (← links)
• Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization (Q5037570) (← links)
• (Q5042653) (← links)
• Exact gradient methods with memory (Q5058416) (← links)
• Revisiting linearized Bregman iterations under Lipschitz-like convexity condition (Q5058656) (← links)
• The Bregman Proximal Average (Q5081784) (← links)