Non-monotonous sequential subgradient projection algorithm for convex feasibility problem
From MaRDI portal
Publication:519264
DOI10.1007/s10255-016-0630-5zbMath1358.90136OpenAlexW2523963090MaRDI QIDQ519264
Jun-ling Sun, Yan Gao, Ya-Zheng Dang
Publication date: 4 April 2017
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-016-0630-5
Numerical optimization and variational techniques (65K10) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
- A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
- A parallel subgradient projections method for the convex feasibility problem
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Cyclic subgradient projections
- Linear Matrix Inequalities in System and Control Theory
- On Projection Algorithms for Solving Convex Feasibility Problems
- Convex Analysis
- On systems of inequalities with convex functions in the left sides