Giovanni Giallombardo

Orcid: 0000-0002-3714-197X

According to our database1, Giovanni Giallombardo authored at least 21 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Dual formulation of the sparsity constrained optimization problem: application to classification.
Optim. Methods Softw., 2024

The Descent-Ascent Algorithm for DC Programming.
INFORMS J. Comput., 2024

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

2022
Profit maximization via capacity control for distribution logistics problems.
Comput. Ind. Eng., 2022

2021
A Multiple Instance Learning Approach for the Automatic Classification of Skin Lesions (Discussion Paper).
Proceedings of the 29th Italian Symposium on Advanced Database Systems, 2021

2020
Classification in the multiple instance learning framework via spherical separation.
Soft Comput., 2020

Essentials of numerical nonsmooth optimization.
4OR, 2020

DC-SMIL: a multiple instance learning solution via spherical separation for automated detection of displastyc nevi.
Proceedings of the IDEAS 2020: 24th International Database Engineering & Applications Symposium, 2020

2019
SVM-Based Multiple Instance Classification via DC Optimization.
Algorithms, 2019

2018
A savings-based model for two-shipper cooperative routing.
Optim. Lett., 2018

Minimizing Piecewise-Concave Functions Over Polyhedra.
Math. Oper. Res., 2018

Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations.
J. Glob. Optim., 2018

Numerical infinitesimals in a variable metric method for convex nonsmooth optimization.
Appl. Math. Comput., 2018

2016
New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials.
Oper. Res., 2016

2015
Optimal Replenishment Order Placement in a Finite Time Horizon.
J. Optim. Theory Appl., 2015

A partially inexact bundle method for convex semi-infinite minmax problems.
Commun. Nonlinear Sci. Numer. Simul., 2015

2009
On solving the Lagrangian dual of integer programs via an incremental approach.
Comput. Optim. Appl., 2009

2008
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs.
Math. Program., 2008

2006
An Incremental Method for Solving Convex Finite Min-Max Problems.
Math. Oper. Res., 2006

2004
Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control.
SIAM J. Optim., 2004

A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization.
Optim. Methods Softw., 2004


  Loading...