scientific article
From MaRDI portal
Publication:2768012
zbMath0990.90094MaRDI QIDQ2768012
Publication date: 9 April 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convex feasibility problemsplit feasibility probleminterior point algorithmsuccesive generalized projections
Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51)
Related Items (14)
Algorithmic and analytical approach to the split common fixed points problem ⋮ Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction ⋮ Dual averaging with adaptive random projection for solving evolving distributed optimization problems ⋮ Perturbed projections and subgradient projections for the multiple-sets split feasibility problem ⋮ On the computation of the step-size for the CQ-like algorithms for the split feasibility problem ⋮ The relaxed inexact projection methods for the split feasibility problem ⋮ Alternating minimization as sequential unconstrained minimization: a survey ⋮ Applications of fixed-point and optimization methods to the multiple-set split feasibility problem ⋮ The split feasibility problem and its solution algorithm ⋮ Characterization results of weak sharp solutions for split variational inequalities with application to traffic analysis ⋮ A new halfspace-relaxation projection method for the split feasibility problem ⋮ Strong convergence of a self-adaptive method for the split feasibility problem ⋮ On variable-step relaxed projection algorithm for variational inequalities ⋮ A new \(CQ\) method for solving split feasibility problem
This page was built for publication:
