Follow
Enrico Gorgone
Enrico Gorgone
Verified email at unica.it
Title
Cited by
Cited by
Year
Bundle methods for sum-functions with “easy” components: applications to multicommodity network design
A Frangioni, E Gorgone
Mathematical Programming 145, 133-161, 2014
812014
Lagrangian relaxation for SVM feature selection
M Gaudioso, E Gorgone, M Labbé, AM Rodríguez-Chía
Computers & Operations Research 87, 137-145, 2017
582017
Piecewise-quadratic approximations in convex numerical optimization
A Astorino, A Frangioni, M Gaudioso, E Gorgone
SIAM Journal on Optimization 21 (4), 1418-1438, 2011
452011
Non-smoothness in classification problems
A Astorino, A Fuduli, E Gorgone
Optimisation Methods & Software 23 (5), 675-688, 2008
322008
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
A Frangioni, B Gendron, E Gorgone
Mathematical Programming Computation 9, 573-604, 2017
282017
A nonmonotone proximal bundle method with (potentially) continuous step decisions
A Astorino, A Frangioni, A Fuduli, E Gorgone
SIAM Journal on Optimization 23 (3), 1784-1809, 2013
272013
Feature selection in SVM via polyhedral k-norm
M Gaudioso, E Gorgone, JB Hiriart-Urruty
Optimization letters 14 (1), 19-36, 2020
252020
Data preprocessing in semi-supervised SVM classification
A Astorino, E Gorgone, M Gaudioso, D Pallaschke
Optimization 60 (1-2), 143-151, 2011
232011
Gradient set splitting in nonconvex nonsmooth numerical optimization
M Gaudioso, E Gorgone
Optimization Methods & Software 25 (1), 59-74, 2010
172010
Piecewise linear approximations in nonconvex nonsmooth optimization
M Gaudioso, E Gorgone, MF Monaco
Numerische Mathematik 113 (1), 73-88, 2009
162009
A library for continuous convex separable quadratic knapsack problems
A Frangioni, E Gorgone
European Journal of Operational Research 229 (1), 37-40, 2013
152013
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
MRA Kazemzadeh, T Bektaş, TG Crainic, A Frangioni, B Gendron, ...
Discrete Applied Mathematics 308, 255-275, 2022
102022
Lagrangian relaxation for the time-dependent combined network design and routing problem
D Papadimitriou, B Fortz, E Gorgone
2015 IEEE international conference on communications (ICC), 6030-6036, 2015
102015
On the computational efficiency of subgradient methods: a case study in combinatorial optimization
A Frangioni, B Gendron, E Gorgone
CIRRELT, Centre interuniversitaire de recherche sur les réseaux d'entreprise …, 2015
72015
Separation of convex sets by Clarke subdifferential
M Gaudioso, E Gorgone, D Pallaschke
Optimization 59 (8), 1199-1210, 2010
72010
A method for convex minimization based on translated first-order approximations
A Astorino, M Gaudioso, E Gorgone
Numerical Algorithms 76, 745-760, 2017
62017
A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem
B Fortz, E Gorgone, D Papadimitriou
Networks 69 (1), 110-123, 2017
62017
Polyhedral separation via difference of convex (DC) programming
A Astorino, MD Francesco, M Gaudioso, E Gorgone, B Manca
Soft Computing 25, 12605-12613, 2021
52021
Dynamic smoothness parameter for fast gradient methods
A Frangioni, B Gendron, E Gorgone
Optimization Letters 12, 43-53, 2018
32018
A new extended formulation with valid inequalities for the Capacitated Concentrator Location Problem
M Di Francesco, M Gaudioso, E Gorgone, I Murthy
European Journal of Operational Research 289 (3), 975-986, 2021
22021
The system can't perform the operation now. Try again later.
Articles 1–20