default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiovanni Giallombardo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Pietro D'Alessandro, Manlio Gaudioso
, Giovanni Giallombardo, Giovanna Miglionico:
The Descent-Ascent Algorithm for DC Programming. INFORMS J. Comput. 36(2): 657-671 (2024)- [j19]Manlio Gaudioso, Giovanni Giallombardo, Jean-Baptiste Hiriart-Urruty:
Dual formulation of the sparsity constrained optimization problem: application to classification. Optim. Methods Softw. 39(1): 84-101 (2024) - 2023
- [j18]Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
Sparse optimization via vector k-norm and DC programming with an application to feature selection for support vector machines. Comput. Optim. Appl. 86(2): 745-766 (2023) - 2022
- [j17]Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
Essentials of numerical nonsmooth optimization. Ann. Oper. Res. 314(1): 213-253 (2022) - [j16]Giovanni Giallombardo, Francesca Guerriero, Giovanna Miglionico:
Profit maximization via capacity control for distribution logistics problems. Comput. Ind. Eng. 171: 108466 (2022) - 2021
- [c2]Eugenio Vocaturo, Ester Zumpano, Giovanni Giallombardo, Giovanna Miglionico:
A Multiple Instance Learning Approach for the Automatic Classification of Skin Lesions (Discussion Paper). SEBD 2021: 395-402 - 2020
- [j15]Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
Essentials of numerical nonsmooth optimization. 4OR 18(1): 1-47 (2020) - [j14]Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico, Eugenio Vocaturo:
Classification in the multiple instance learning framework via spherical separation. Soft Comput. 24(7): 5071-5077 (2020) - [c1]Eugenio Vocaturo, Ester Zumpano, Giovanni Giallombardo, Giovanna Miglionico:
DC-SMIL: a multiple instance learning solution via spherical separation for automated detection of displastyc nevi. IDEAS 2020: 4:1-4:9
2010 – 2019
- 2019
- [j13]Annabella Astorino, Antonio Fuduli, Giovanni Giallombardo, Giovanna Miglionico:
SVM-Based Multiple Instance Classification via DC Optimization. Algorithms 12(12): 249 (2019) - 2018
- [j12]Manlio Gaudioso, Giovanni Giallombardo, Marat S. Mukhametzhanov:
Numerical infinitesimals in a variable metric method for convex nonsmooth optimization. Appl. Math. Comput. 318: 312-320 (2018) - [j11]Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico, Adil M. Bagirov:
Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations. J. Glob. Optim. 71(1): 37-55 (2018) - [j10]Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
Minimizing Piecewise-Concave Functions Over Polyhedra. Math. Oper. Res. 43(2): 580-597 (2018) - [j9]Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
A savings-based model for two-shipper cooperative routing. Optim. Lett. 12(8): 1811-1824 (2018) - 2016
- [j8]Giovanni Giallombardo, Houyuan Jiang, Giovanna Miglionico:
New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials. Oper. Res. 64(4): 838-848 (2016) - 2015
- [j7]Antonio Fuduli, Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
A partially inexact bundle method for convex semi-infinite minmax problems. Commun. Nonlinear Sci. Numer. Simul. 21(1-3): 172-180 (2015) - [j6]Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
Optimal Replenishment Order Placement in a Finite Time Horizon. J. Optim. Theory Appl. 164(3): 1078-1089 (2015)
2000 – 2009
- 2009
- [j5]Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
On solving the Lagrangian dual of integer programs via an incremental approach. Comput. Optim. Appl. 44(1): 117-138 (2009) - 2008
- [j4]Giovanni Giallombardo, Daniel Ralph:
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs. Math. Program. 112(2): 335-369 (2008) - 2006
- [j3]Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
An Incremental Method for Solving Convex Finite Min-Max Problems. Math. Oper. Res. 31(1): 173-187 (2006) - 2004
- [j2]Antonio Fuduli, Manlio Gaudioso, Giovanni Giallombardo:
A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization. Optim. Methods Softw. 19(1): 89-102 (2004) - [j1]Antonio Fuduli, Manlio Gaudioso, Giovanni Giallombardo:
Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control. SIAM J. Optim. 14(3): 743-756 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
