Result 1 to 20 of 62 total
Convex feasibility modeling and projection methods for sparse signal recovery. (English)
J. Comput. Appl. Math. 236, No. 17, 4318-4335 (2012).
1
Algorithms for the split variational inequality problem. (English)
Numer. Algorithms 59, No. 2, 301-323 (2012).
2
Opial-type theorems and the common fixed point problem. (English)
Bauschke, Heinz H. (ed.) et al., Fixed-point algorithms for inverse problems in science and engineering. Based on the presentations at the interdisciplinary workshop, BIRS, Banff, Canada, November 1‒6, 2009. New York, NY: Springer (ISBN 978-1-4419-9568-1/hbk; 978-1-4419-9569-8/ebook). Springer Optimization and Its Applications 49, 155-183 (2011).
3
The subgradient extragradient method for solving variational inequalities in Hilbert space (English)
J. Optimization Theory and Applications 148, No. 2, 318-335 (2011).
4
Perturbation resilience and superiorization of iterative algorithms. (English)
Comput. Res. Repos. 2010, Article No. 1005.0069 (2010).
5
Perturbation resilience and superiorization of iterative algorithms. (English)
Inverse Probl. 26, No. 6, Article ID 065008, 12 p. (2010).
6
Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections. (English)
Int. Trans. Oper. Res. 16, No. 4, 505-524 (2009).
7
A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin. (English)
J. Fourier Anal. Appl. 15, No. 4, 431-436 (2009).
8
The split common fixed point problem for directed operators. (English)
J. Convex Anal. 16, No. 2, 587-600 (2009).
9
On diagonally relaxed orthogonal projection methods. (English)
SIAM J. Sci. Comput. 30, No. 1, 473-504 (2008).
10
Projections onto super-half-spaces for monotone variational inequality problems in finite-dimensional space. (English)
J. Nonlinear Convex Anal. 9, No. 3, 461-475 (2008).
11
General algorithmic frameworks for online problems. (English)
Int. J. Pure Appl. Math. 46, No. 1, 19-36 (2008).
12
On linear infeasibility arising in intensity-modulated radiation therapy inverse planning. (English)
Linear Algebra Appl. 428, No. 5-6, 1406-1420 (2008).
13
Mathematical methods in biomedical imaging and intensity-modulated radiation therapy (IMRT). Most papers based on the presentations at the interdisciplinary workshop, Pisa, Italy, October 15‒19, 2007. (English)
Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series (Nuova Serie) 7. Pisa: Edizioni della Normale (ISBN 978-88-7642-314-7/pbk). xx, 526~p. EUR~30.00/net; SFR~52.00; \sterling~23.99; \$~39.95 (2008).
14
On the behavior of subgradient projections methods for convex feasibility problems in Euclidean spaces (English)
SIAM Journal on Optimization 19, No. 2, 786-807 (2008).
15
Perturbed projections and subgradient projections for the multiple-sets split feasibility problem. (English)
J. Math. Anal. Appl. 327, No. 2, 1244-1256 (2007).
16
The application of an oblique-projected Landweber method to a model of supervised learning. (English)
Math. Comput. Modelling 43, No. 7-8, 892-909 (2006).
17
Computational acceleration of projection algorithms for the linear best approximation problem. (English)
Linear Algebra Appl. 416, No. 1, 111-123 (2006).
18
Algorithms for the quasiconvex feasibility problem. (English)
J. Comput. Appl. Math. 185, No. 1, 34-50 (2006).
19
The application of an oblique-projected Landweber method to a model of supervised learning (English)
Mathematical and Computer Modelling 43, No. 7-8, 892-909 (2006).
20
Result 1 to 20 of 62 total