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.
- 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)
- A hybrid extragradient method for solving pseudomonotone equilibrium problems using Bregman distance (Q1615338) (← links)
- A strong convergence theorem for solving the split feasibility and fixed point problems in Banach spaces (Q1615347) (← links)
- Note on the modified relaxation CQ algorithm for the split feasibility problem (Q1653279) (← links)
- Approximation of common fixed points of nonlinear mappings satisfying jointly demi-closedness principle in Banach spaces (Q1679161) (← links)
- Parallel iterative methods for Bregman strongly nonexpansive operators in reflexive Banach spaces (Q1687155) (← links)
- Approximation of common solutions of nonlinear problems involving various classes of mappings (Q1713951) (← links)
- Applications of Bregman-Opial property to Bregman nonspreading mappings in Banach spaces (Q1723730) (← links)
- Convergence theorems for right Bregman strongly nonexpansive mappings in reflexive Banach spaces (Q1724444) (← links)
- Bregman \(f\)-projection operator with applications to variational inequalities in Banach spaces (Q1724472) (← links)
- A new multi-step iterative algorithm for approximating common fixed points of a finite family of multi-valued Bregman relatively nonexpansive mappings (Q1736800) (← links)
- A modified iterative algorithm for split feasibility problems of right Bregman strongly quasi-nonexpansive mappings in Banach spaces with applications (Q1736849) (← links)
- The general split equality problem for Bregman quasi-nonexpansive mappings in Banach spaces (Q1742515) (← links)
- Existence and convergence theorems for Bregman best proximity points in reflexive Banach spaces (Q1742559) (← links)
- Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces (Q1770096) (← links)
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization (Q1783579) (← links)
- On the unification of possibilistic fuzzy clustering: axiomatic development and convergence analysis (Q1795022) (← 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)
- A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems (Q2000703) (← links)