Articles avec mandats d'accès public - A. IusemEn savoir plus
Non disponibles : 3
An alternating direction method of multipliers for the eigenvalue complementarity problem
JJ Júdice, M Fukushima, A Iusem, JM Martinez, V Sessa
Optimization Methods and Software 36 (2-3), 337-370, 2021
Exigences : Fundação para a Ciência e a Tecnologia, Portugal
On the numerical solution of the quadratic eigenvalue complementarity problem
AN Iusem, JJ Júdice, V Sessa, HD Sherali
Numerical Algorithms 72, 721-747, 2016
Exigences : Fundação para a Ciência e a Tecnologia, Portugal
On OM-decomposable sets
AN Iusem, MI Todorov
Computational and Applied Mathematics 37 (3), 2837-2844, 2018
Exigences : Government of Spain
Disponibles quelque part : 11
Projections onto convex sets on the sphere
OP Ferreira, AN Iusem, SZ Németh
Journal of Global Optimization 57 (3), 663-676, 2013
Exigences : Hungarian Scientific Research Fund
Motzkin decomposition of closed convex sets via truncation
MA Goberna, A Iusem, JE Martinez-Legaz, MI Todorov
Journal of Mathematical Analysis and Applications 400 (1), 35-47, 2013
Exigences : Australian Research Council, Government of Spain
Motzkin predecomposable sets
AN Iusem, JE Martinez-Legaz, MI Todorov
Journal of Global Optimization 60 (4), 635-647, 2014
Exigences : Government of Spain
The circumcentered-reflection method achieves better rates than alternating projections
R Arefidamghani, R Behling, Y Bello-Cruz, AN Iusem, LR Santos
Computational Optimization and Applications 79 (2), 507-530, 2021
Exigences : US National Science Foundation
On the quadratic eigenvalue complementarity problem
CP Brás, AN Iusem, JJ Júdice
Journal of Global Optimization 66 (2), 153-171, 2016
Exigences : Fundação para a Ciência e a Tecnologia, Portugal
A proximal point method in nonreflexive Banach spaces
AN Iusem, E Resmerita
Set-Valued and Variational Analysis 18, 109-120, 2010
Exigences : Austrian Science Fund
Splitting methods for the eigenvalue complementarity problem
AN Iusem, JJ Júdice, V Sessa, P Sarabando
Optimization Methods and Software 34 (6), 1184-1212, 2019
Exigences : Fundação para a Ciência e a Tecnologia, Portugal
An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
RS Burachik, AN Iusem, JG Melo
Journal of Optimization Theory and Applications 157, 108-131, 2013
Exigences : Australian Research Council
Circumcentering approximate reflections for solving the convex feasibility problem
GHM Araújo, R Arefidamghani, R Behling, Y Bello-Cruz, A Iusem, ...
Fixed Point Theory and Algorithms for Sciences and Engineering 2022 (1), 1, 2022
Exigences : US National Science Foundation
On the quadratic eigenvalue complementarity problem over a general convex cone
CP Brás, M Fukushima, AN Iusem, JJ Júdice
Applied Mathematics and Computation 271, 594-608, 2015
Exigences : Fundação para a Ciência e a Tecnologia, Portugal
A successive centralized circumcentered-reflection method for the convex feasibility problem
R Behling, Y Bello-Cruz, A Iusem, D Liu, LR Santos
Computational Optimization and Applications 87 (1), 83-116, 2024
Exigences : US National Science Foundation
Les informations concernant la publication et le financement sont déterminées automatiquement par un programme informatique