Robust solutions of split feasibility problem with uncertain linear operator

DOI10.3934/jimo.2007.3.749zbMath1242.90169OpenAlexW2327609270MaRDI QIDQ2468850

Ailing Yan, Gao-Yang Wang, Nai-Hua Xiu

Publication date: 11 February 2008

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2007.3.749

zbMATH Keywords

uncertaintyrobustnessoptimization reformulationsplit feasibility problem (SFP)minimum split feasibility problem

Mathematics Subject Classification ID

Convex programming (90C25) Minimax problems in mathematical programming (90C47)

Related Items (6)

Hybrid CQ projection algorithm with line-search process for the split feasibility problem ⋮ Inertial accelerated algorithms for solving a split feasibility problem ⋮ New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem ⋮ Relaxed inertial accelerated algorithms for solving split equality feasibility problem ⋮ An inertial extrapolation method for multiple-set split feasibility problem ⋮ Robust linear programming with norm uncertainty

This page was built for publication: Robust solutions of split feasibility problem with uncertain linear operator