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.
- A dual gradient-projection algorithm for model predictive control in fixed-point arithmetic (Q1689378) (← links)
- Higher order convergence rates for Bregman iterated variational regularization of inverse problems (Q1713400) (← links)
- Learning in games with continuous action sets and unknown payoff functions (Q1717237) (← links)
- Applications of Bregman-Opial property to Bregman nonspreading mappings in Banach spaces (Q1723730) (← links)
- Bregman \(f\)-projection operator with applications to variational inequalities in Banach spaces (Q1724472) (← links)
- Existence and convergence theorems for Bregman best proximity points in reflexive Banach spaces (Q1742559) (← links)
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409) (← links)
- Mirror descent and nonlinear projected subgradient methods for convex optimization. (Q1811622) (← links)
- Some properties of generalized proximal point methods for quadratic and linear programming (Q1896573) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- Interior point methods for equilibrium problems (Q1928742) (← links)
- A generalized univariate Newton method motivated by proximal regularization (Q1935256) (← links)
- An interior proximal method for a class of quasimonotone variational inequalities (Q1935257) (← links)
- Alternating minimization as sequential unconstrained minimization: a survey (Q1949577) (← links)
- An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds (Q1955549) (← links)
- Pseudomonotone operators and the Bregman proximal point algorithm (Q1959229) (← links)
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis (Q2010228) (← links)
- Bregman asymptotic pointwise nonexpansive mappings in Banach spaces (Q2015355) (← links)
- Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization (Q2033682) (← links)
- The condition number of a function relative to a set (Q2039239) (← links)
- An enhanced Baillon-Haddad theorem for convex functions defined on convex sets (Q2041035) (← links)
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization (Q2044481) (← links)
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
- Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems (Q2046311) (← links)
- An ADMM-based SQP method for separably smooth nonconvex optimization (Q2069362) (← links)
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning (Q2073715) (← links)
- A dual Bregman proximal gradient method for relatively-strongly convex optimization (Q2092292) (← links)
- On Bregman-type distances and their associated projection mappings (Q2139246) (← links)
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem (Q2158622) (← links)
- Theoretical aspect of diagonal Bregman proximal methods (Q2176024) (← links)
- Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings (Q2193778) (← links)
- Inexact version of Bregman proximal gradient algorithm (Q2198034) (← links)
- Testing and non-linear preconditioning of the proximal point method (Q2198162) (← links)
- An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901) (← links)
- Generalized Bregman envelopes and proximity operators (Q2231335) (← links)
- Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup (Q2235160) (← links)
- Existence of common fixed points using Bregman nonexpansive retracts and Bregman functions in Banach spaces (Q2249106) (← links)
- Algorithms of robust stochastic optimization based on mirror descent method (Q2289049) (← links)
- The modified second APG method for DC optimization problems (Q2311112) (← links)
- On a Bregman regularized proximal point method for solving equilibrium problems (Q2311203) (← links)
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption (Q2322358) (← links)
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity (Q2322369) (← links)
- Weak convergence theorems for Bregman relatively nonexpansive mappings in Banach spaces (Q2336550) (← links)
- Lagrangian transformation and interior ellipsoid methods in convex optimization (Q2342139) (← links)
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862) (← links)
- Iterative total variation regularization with non-quadratic fidelity (Q2384073) (← links)
- Inverse scale spaces for nonlinear regularization (Q2384098) (← links)
