Suivre
Ron Shefi
Ron Shefi
Affiliation inconnue
Adresse e-mail validée de math.uni-goettingen.de
Titre
Citée par
Citée par
Année
Rate of convergence analysis of decomposition methods based on the proximal method of multipliers for convex minimization
R Shefi, M Teboulle
SIAM Journal on Optimization 24 (1), 269-297, 2014
1862014
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
R Shefi, M Teboulle
EURO Journal on Computational Optimization 4, 27-46, 2016
332016
A moving balls approximation method for a class of smooth constrained minimization problems
A Auslender, R Shefi, M Teboulle
SIAM Journal on Optimization 20 (6), 3232-3259, 2010
262010
Development of a multiomics database for personalized prognostic forecasting in head and neck cancer: The Big Data to Decide EU Project
S Cavalieri, L De Cecco, RH Brakenhoff, MS Serafini, S Canevari, S Rossi, ...
Head & neck 43 (2), 601-612, 2021
232021
A globally linearly convergent method for pointwise quadratically supportable convex–concave saddle point problems
DR Luke, R Shefi
Journal of Mathematical Analysis and Applications 457 (2), 1568-1590, 2018
142018
A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
R Shefi, M Teboulle
Mathematical Programming 159, 137-164, 2016
72016
Rate of convergence analysis for convex nonsmooth optimization algorithms
R Shefi
Tel-Aviv University, 2015
72015
Efficient, Quantitative Numerical Methods for Statistical Image Deconvolution and Denoising
DR Luke, C Charitha, R Shefi, Y Malitsky
Nanoscale Photonic Imaging, 313-338, 2020
22020
Genomics features (GF) and integration with MRI radiomics features (RF) to develop a prognostic model in oral cavity squamous cell carcinoma (OSCC)
S Cavalieri, L De Cecco, G Calareso, M Silva, SE Gazzani, M Bologna, ...
Annals of Oncology 29, viii376, 2018
2018
A Moving Balls Approximation Method for Smooth Constrained Minimization
R Shefi
Tel Aviv University, 2009
2009
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–10