Pages that link to "Item:Q1181736"

The following pages link to On the convergence of Han's method for convex programming with quadratic objective (Q1181736):

Displaying 32 items.

• Fundamentals of cone regression (Q289730) (← links)
• Iterative algorithms for solving variational inequalities and fixed point problems for asymptotically nonexpansive mappings in Banach spaces (Q342885) (← links)
• Strong and weak convergence theorems for an infinite family of nonexpansive mappings and applications (Q375419) (← links)
• New iterative approximation methods for a countable family of nonexpansive mappings in Banach spaces (Q623563) (← links)
• The general iterative methods for nonexpansive mappings in Banach spaces (Q652654) (← links)
• A general iterative method for a finite family of nonexpansive mappings (Q876944) (← links)
• Strong convergence of a general iterative method for variational inequality problems and fixed point problems in Hilbert spaces (Q929439) (← links)
• A general iterative method for an infinite family of nonexpansive mappings (Q938726) (← links)
• Strong convergence of a modified iterative algorithm for mixed-equilibrium problems in Hilbert spaces (Q949016) (← links)
• Equivalent theorems of the convergence between Ishikawa-Halpern iteration and viscosity approximation method (Q972954) (← links)
• Strong convergence of the modified Ishikawa iterative method for infinitely many nonexpansive mappings in Banach spaces (Q980196) (← links)
• Strong convergence of an iterative algorithm on an infinite countable family of nonexpansive mappings (Q1004181) (← links)
• Iterative algorithms for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of families and semigroups of nonexpansive mappings (Q1015126) (← links)
• Strong convergence theorems for an infinite family of nonexpansive mappings in Banach spaces (Q1026436) (← links)
• A general iterative method for solving the variational inequality problem and fixed point problem of an infinite family of nonexpansive mappings in Hilbert spaces (Q1030615) (← links)
• A proximal-based deomposition method for compositions method for convex minimization problems (Q1330895) (← links)
• A row-action method for convex programming (Q1330898) (← links)
• A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
• Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
• Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
• Two-step viscosity approximation scheme for variational inequality in Banach spaces (Q1723772) (← links)
• Primal-dual row-action method for convex programming (Q1904955) (← links)
• A parallel inexact Newton method for stochastic programs with recourse (Q1918424) (← links)
• Strong convergence of a self-adaptive method for the split feasibility problem (Q2253220) (← links)
• Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367) (← links)
• An iterative algorithm for approximating convex minimization problem (Q2371476) (← links)
• Approximation of common fixed points of an infinite family of nonexpansive mappings in Banach spaces (Q2389750) (← links)
• Strong convergence of a general iterative algorithm for equilibrium problems and variational inequality problems (Q2389802) (← links)
• How good are projection methods for convex feasibility problems? (Q2427393) (← links)
• Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243) (← links)
• Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
• (Q5884027) (← links)