Antonio Fuduli

Optim. Lett., March, 2024

2023

Partitional clustering via successive transportation problems.

[BibT_eX]

[DOI]

Oper. Res. Lett., January, 2023

Maximum-margin polyhedral separation for binary Multiple Instance Learning.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., January, 2023

Multiple Instance Learning for Diabetic Retinopathy Detection.

[BibT_eX]

[DOI]

Proceedings of the 31st Symposium of Advanced Database Systems, 2023

On Detection of Diabetic Retinopathy via Multiple Instance Learning.

[BibT_eX]

[DOI]

Proceedings of the International Database Engineered Applications Symposium Conference, 2023

2022

A heuristic approach for multiple instance learning by linear separation.

[BibT_eX]

[DOI]

Soft Comput., 2022

A maximum-margin multisphere approach for binary Multiple Instance Learning.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2022

Multiple Instance Learning for viral pneumonia chest X-ray Classification.

[BibT_eX]

[DOI]

Proceedings of the 30th Italian Symposium on Advanced Database Systems, 2022

2021

A Semiproximal Support Vector Machine Approach for Binary Multiple Instance Learning.

[BibT_eX]

[DOI]

IEEE Trans. Neural Networks Learn. Syst., 2021

Viral pneumonia images classification by Multiple Instance Learning: preliminary results.

[BibT_eX]

[DOI]

Proceedings of the IDEAS 2021: 25th International Database Engineering & Applications Symposium, 2021

2020

Spherical separation with infinitely far center.

[BibT_eX]

[DOI]

Soft Comput., 2020

A subset-sum type formulation of a two-agent single-machine scheduling problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

2019

A Lagrangian Relaxation Approach for Binary Multiple Instance Classification.

[BibT_eX]

[DOI]

IEEE Trans. Neural Networks Learn. Syst., 2019

SVM-Based Multiple Instance Classification via DC Optimization.

[BibT_eX]

[DOI]

Giovanna Miglionico

Algorithms, 2019

Multiple Instance Learning Algorithm for Medical Image Classification.

[BibT_eX]

[DOI]

Proceedings of the 27th Italian Symposium on Advanced Database Systems, 2019

2018

A Multiple Instance Learning Algorithm for Color Images Classification.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Database Engineering & Applications Symposium, 2018

2017

On a recent algorithm for multiple instance learning. Preliminary applications in image classification.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Conference on Bioinformatics and Biomedicine, 2017

2016

The Proximal Trajectory Algorithm in SVM Cross Validation.

[BibT_eX]

[DOI]

IEEE Trans. Neural Networks Learn. Syst., 2016

2015

Support Vector Machine Polyhedral Separability in Semisupervised Learning.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2015

A partially inexact bundle method for convex semi-infinite minmax problems.

[BibT_eX]

[DOI]

Giovanna Miglionico

Commun. Nonlinear Sci. Numer. Simul., 2015

2013

A Nonmonotone Proximal Bundle Method with (Potentially) Continuous Step Decisions.

[BibT_eX]

[DOI]

SIAM J. Optim., 2013

2012

Margin maximization in spherical separation.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2012

2010

DC models for spherical separation.

[BibT_eX]

[DOI]

J. Glob. Optim., 2010

2008

Non-smoothness in classification problems.

[BibT_eX]

[DOI]

Enrico Gorgone

Optim. Methods Softw., 2008

2007

Nonsmooth Optimization Techniques for Semisupervised Classification.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2007

Integrated Shipment Dispatching and Packing Problems: a Case Study.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2007

A bundle modification strategy for convex minimization.

[BibT_eX]

[DOI]

Alexey V. Demyanov

Giovanna Miglionico

Eur. J. Oper. Res., 2007

2004

Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control.

[BibT_eX]

[DOI]

SIAM J. Optim., 2004

A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2004

On the performance of switching BFGS/SR1 algorithms for unconstrained optimization.

[BibT_eX]

[DOI]

Mehiddin Al-Baali