Pages that link to "Item:Q1138236"
From MaRDI portal
The following pages link to An iterative row-action method for interval convex programming (Q1138236):
Displayed 50 items.
- Strong convergence theorem for Bregman strongly nonexpansive mappings and equilibrium problems in reflexive Banach spaces (Q364597) (← links)
- Strong convergence iterative algorithms for equilibrium problems and fixed point problems in Banach spaces (Q370078) (← links)
- Halpern-Mann's iterations for Bregman strongly nonexpansive mappings in reflexive Banach spaces with applications (Q394712) (← links)
- Operator splittings, Bregman methods and frame shrinkage in image processing (Q408893) (← links)
- Right Bregman nonexpansive operators in Banach spaces (Q450585) (← links)
- An algorithm for maximum entropy image reconstruction from noisy data (Q582945) (← links)
- A projection method for solving nonlinear problems in reflexive Banach spaces (Q626556) (← links)
- A unified primal-dual algorithm framework based on Bregman iteration (Q639393) (← links)
- A row relaxation method for large minimax problems (Q688632) (← links)
- SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality (Q691483) (← links)
- Halpern's iteration for Bregman strongly nonexpansive mappings in reflexive Banach spaces (Q692282) (← links)
- On a generalized proximal point method for solving equilibrium problems in Banach spaces (Q714471) (← links)
- Optimization of Burg's entropy over linear constraints (Q756379) (← links)
- Interval-constrained matrix balancing (Q758125) (← links)
- The primal-dual algorithm as a constraint-set-manipulation device (Q811396) (← links)
- Some new multiplicative algorithms for image reconstruction from projections (Q915376) (← links)
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming (Q937140) (← links)
- Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces (Q975247) (← links)
- Removing multiplicative noise by Douglas-Rachford splitting methods (Q993562) (← links)
- On some algorithms in Banach spaces finding fixed points of nonlinear mappings (Q1029434) (← links)
- A relaxed version of Bregman's method for convex programming (Q1067977) (← links)
- On some optimization techniques in image reconstruction from projections (Q1109546) (← links)
- Parallel application of block-iterative methods in medical imaging and radiation therapy (Q1111951) (← links)
- Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
- On some methods for entropy maximization and matrix scaling (Q1151726) (← links)
- Scalings of matrices satisfying line-product constraints and generalizations (Q1200557) (← links)
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators (Q1290609) (← links)
- Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems (Q1308671) (← links)
- A model for portfolio management with mortgage-backed securities (Q1309882) (← links)
- On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
- Proximal minimization algorithm with \(D\)-functions (Q1321192) (← links)
- Data parallel computing for network-structured optimization problems (Q1328430) (← links)
- A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces (Q1364216) (← links)
- An interior point method for the nonlinear complementarity problem (Q1369440) (← links)
- A proximal point algorithm for minimax problems (Q1371666) (← links)
- Generalized Bregman projections in convex feasibility problems (Q1384057) (← links)
- Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) (← links)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
- Approximation of linear programs by Bregman's \(D_F\) projections (Q1584816) (← links)
- Adaptive and self-confident on-line learning algorithms (Q1604218) (← links)
- Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces (Q1770096) (← links)
- Mirror descent and nonlinear projected subgradient methods for convex optimization. (Q1811622) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- Duality for Bregman projections onto translated cones and affine subspaces. (Q1874472) (← links)
- A parallel relaxation method for quadratic programming problems with interval constraints (Q1900763) (← links)
- Asynchronous gradient algorithms for a class of convex separable network flow problems (Q1915768) (← links)
- Solving multistage stochastic network programs on massively prallel computers (Q1918923) (← links)
- Composite iterative schemes for maximal monotone operators in reflexive Banach spaces (Q1952119) (← links)
- An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds (Q1955549) (← links)