Miguel A. Goberna: “The Challenge was to Bring Spanish Research in Mathematics to Normality”

[1] Anderson EJ(2001)Simplex-like trajectories on quasi-polyhedral convex sets Math. Oper. Res. 26 147-162

[2] Goberna MA(2009)Penalty and smoothing methods for convex semi-infinite programming Math. Oper. Res. 34 303-319

[3] López MA(2015)Stability in linear optimization under perturbations of the left-hand side coefficients Set-valued. Var. Anal. 23 737-758

[4] Auslender A(2006)From linear to convex systems:Consistency, Farkas Lemma and applications J. Convex. Anal. 13 113-133

[5] Goberna MA(2007)New Farkas-type constraint qualifications in convex infinite programming ESAIM:. Control. Optim. Cal. Var. 13 580-597

[6] López MA(2017)A unifying approach to robust convex infinite optimization duality J. Optim. Theory. Appl. 174 650-685

[7] Daniilidis A(2021)Duality for constrained robust sum optimization problems Math. Programming. 189B 271-297

[8] Goberna MA(2017)A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem Ann. Oper. Res. 258 587-612

[9] López MA(1987)Boundedness relations in linear semi-infinite programming Adv. Appl. Math. 8 53-68

[10] Lucchetti R(2010)Motzkin decomposition of closed convex sets J. Math. Anal. Appl. 364 209-221

[1] Anderson EJ(2001)Simplex-like trajectories on quasi-polyhedral convex sets Math. Oper. Res. 26 147-162

[2] Goberna MA(2009)Penalty and smoothing methods for convex semi-infinite programming Math. Oper. Res. 34 303-319

[3] López MA(2015)Stability in linear optimization under perturbations of the left-hand side coefficients Set-valued. Var. Anal. 23 737-758

[4] Auslender A(2006)From linear to convex systems:Consistency, Farkas Lemma and applications J. Convex. Anal. 13 113-133

[5] Goberna MA(2007)New Farkas-type constraint qualifications in convex infinite programming ESAIM:. Control. Optim. Cal. Var. 13 580-597

[6] López MA(2017)A unifying approach to robust convex infinite optimization duality J. Optim. Theory. Appl. 174 650-685

[7] Daniilidis A(2021)Duality for constrained robust sum optimization problems Math. Programming. 189B 271-297

[8] Goberna MA(2017)A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem Ann. Oper. Res. 258 587-612

[9] López MA(1987)Boundedness relations in linear semi-infinite programming Adv. Appl. Math. 8 53-68

[10] Lucchetti R(2010)Motzkin decomposition of closed convex sets J. Math. Anal. Appl. 364 209-221