Manlio Gaudioso
Orcid: 0000-0002-3022-7041Affiliations:
- Universita' della Calabria
According to our database1,
Manlio Gaudioso
authored at least 69 papers
between 1982 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
1985
1990
1995
2000
2005
2010
2015
2020
2025
0
1
2
3
4
5
6
7
8
1
4
3
2
4
3
3
6
5
3
2
3
1
1
1
3
4
1
2
2
2
1
2
1
1
1
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
2024
A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization.
Optim. Lett., January, 2024
Dual formulation of the sparsity constrained optimization problem: application to classification.
Optim. Methods Softw., 2024
A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem.
EURO J. Comput. Optim., 2024
2023
New mixed integer fractional programming problem and some multi-objective models for sparse optimization.
Soft Comput., November, 2023
Sparse optimization via vector k-norm and DC programming with an application to feature selection for support vector machines.
Comput. Optim. Appl., November, 2023
Algorithms, 2023
Proceedings of the Numerical Computations: Theory and Algorithms, 2023
2022
Soft Comput., 2022
Deforming $||.||_{1}$ into $||.||_{\infty}$ via Polyhedral Norms: A Pedestrian Approach.
SIAM Rev., 2022
2021
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs.
Networks, 2021
A Lagrangean relaxation approach to lifetime maximization of directional sensor networks.
Networks, 2021
A new extended formulation with valid inequalities for the Capacitated Concentrator Location Problem.
Eur. J. Oper. Res., 2021
2020
Soft Comput., 2020
2019
IEEE Trans. Neural Networks Learn. Syst., 2019
Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization.
Optim. Methods Softw., 2019
Proceedings of the 27th Italian Symposium on Advanced Database Systems, 2019
2018
A Lagrangean-based decomposition approach for the link constrained Steiner tree problem.
Optim. Methods Softw., 2018
J. Glob. Optim., 2018
Numerical infinitesimals in a variable metric method for convex nonsmooth optimization.
Appl. Math. Comput., 2018
Proceedings of the 22nd International Database Engineering & Applications Symposium, 2018
2017
Numer. Algorithms, 2017
Comput. Oper. Res., 2017
2016
Comput. Optim. Appl., 2016
Proceedings of the Mathematical Software - ICMS 2016, 2016
2015
J. Optim. Theory Appl., 2015
Commun. Nonlinear Sci. Numer. Simul., 2015
2014
J. Glob. Optim., 2014
2013
Comput. Optim. Appl., 2013
2012
2011
SIAM J. Optim., 2011
2010
Optim. Methods Softw., 2010
2009
Least Square Regression Method for Estimating Gas Concentration in an Electronic Nose System.
Sensors, 2009
Numerische Mathematik, 2009
Comput. Optim. Appl., 2009
A fixed-center spherical separation algorithm with kernel transformations for classification problems.
Comput. Manag. Sci., 2009
2007
Eur. J. Oper. Res., 2007
Proceedings of the 7th International Conference on Hybrid Intelligent Systems, 2007
2006
Math. Oper. Res., 2006
INFORMS J. Comput., 2006
2005
2004
SIAM J. Optim., 2004
A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization.
Optim. Methods Softw., 2004
1993
Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems.
Ann. Oper. Res., 1993
1992
1991
1988
Comput. Oper. Res., 1988
1984
1983
Probabilistic Appraoch to Evaluation of Data Manipulation Algorithms in a CODASYL Data Base Environment.
Proceedings of the Second International Conference On Databases, 1983
1982
A bundle type approach to the unconstrained minimization of convex nonsmooth functions.
Math. Program., 1982