default search action
Giampaolo Liuzzi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j41]Manlio Gaudioso, Giampaolo Liuzzi
, Stefano Lucidi:
A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization. Optim. Lett. 18(1): 57-71 (2024) - 2022
- [j40]Luigi Bianchi, Chiara Liti, Giampaolo Liuzzi, Veronica Piccialli
Improving P300 Speller performance by means of optimization and machine learning. Ann. Oper. Res. 312(2): 1221-1259 (2022) - [j39]Tommaso Giovannelli, Giampaolo Liuzzi
Derivative-free methods for mixed-integer nonsmooth constrained optimization. Comput. Optim. Appl. 82(2): 293-327 (2022) - [j38]Andrea Cristofari
An Augmented Lagrangian Method Exploiting an Active-Set Strategy and Second-Order Information. J. Optim. Theory Appl. 193(1): 300-323 (2022) - [j37]Giampaolo Liuzzi, Marco Locatelli
A computational study on QP problems with general linear constraints. Optim. Lett. 16(6): 1633-1647 (2022) - [i1]Giampaolo Liuzzi, Laura Palagi, Ruggiero Seccia:
Convergence under Lipschitz smoothness of ease-controlled Random Reshuffling gradient Algorithms. CoRR abs/2212.01848 (2022) - 2021
- [j36]Giampaolo Liuzzi, Marco Locatelli
Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems. Comput. Optim. Appl. 79(3): 561-599 (2021) - 2020
- [j35]Guido Cocchi, Giampaolo Liuzzi, Stefano Lucidi, Marco Sciandrone:
On the convergence of steepest descent methods for multiobjective optimization. Comput. Optim. Appl. 77(1): 1-27 (2020) - [j34]Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi:
An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables. Math. Program. Comput. 12(4): 673-702 (2020) - [j33]Guido Cocchi
A concave optimization-based approach for sparse multiobjective programming. Optim. Lett. 14(3): 535-556 (2020)
2010 – 2019
- 2019
- [j32]Giampaolo Liuzzi
A new branch-and-bound algorithm for standard quadratic programming problems. Optim. Methods Softw. 34(1): 79-97 (2019) - [j31]Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi, Luís Nunes Vicente
Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions. SIAM J. Optim. 29(4): 3012-3035 (2019) - 2018
- [j30]Guido Cocchi
An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints. Comput. Optim. Appl. 69(2): 267-296 (2018) - [j29]Emilio Fortunato Campana
A multi-objective DIRECT algorithm for ship hull optimization. Comput. Optim. Appl. 71(1): 53-72 (2018) - 2017
- [c1]Riccardo Pellegrini
Hybrid Global/Local Derivative-Free Multi-objective Optimization via Deterministic Particle Swarm with Local Linesearch. MOD 2017: 198-209 - 2016
- [j28]Gianni Di Pillo, Giampaolo Liuzzi
A DIRECT-type approach for derivative-free constrained global optimization. Comput. Optim. Appl. 65(2): 361-397 (2016) - [j27]Giampaolo Liuzzi
Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization. Comput. Optim. Appl. 65(2): 449-475 (2016) - [j26]Marianna De Santis
A nonmonotone GRASP. Math. Program. Comput. 8(3): 271-309 (2016) - [j25]Giampaolo Liuzzi
A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization. SIAM J. Optim. 26(4): 2744-2774 (2016) - 2015
- [j24]Tommaso Bianconcini
On the use of iterative methods in cubic regularization for unconstrained optimization. Comput. Optim. Appl. 60(1): 35-57 (2015) - [j23]Francesco Lampariello, Giampaolo Liuzzi
A filling function method for unconstrained global optimization. Comput. Optim. Appl. 61(3): 713-729 (2015) - [j22]Angelo Ciccazzo, Vittorio Latorre
Derivative-Free Robust Optimization for Circuit Design. J. Optim. Theory Appl. 164(3): 842-861 (2015) - [j21]Giampaolo Liuzzi
Derivative-Free Methods for Mixed-Integer Constrained Optimization Problems. J. Optim. Theory Appl. 164(3): 933-965 (2015) - [j20]Francesco Lampariello, Giampaolo Liuzzi
Global Optimization of Protein-peptide Docking by a Filling Function Method. J. Optim. Theory Appl. 164(3): 1090-1108 (2015) - [j19]Giampaolo Liuzzi
Solving ℓ0-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method. Optim. Lett. 9(1): 57-74 (2015) - 2014
- [j18]Giovanni Fasano
A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization. SIAM J. Optim. 24(3): 959-992 (2014) - 2012
- [j17]Giampaolo Liuzzi
Derivative-free methods for bound constrained mixed-integer optimization. Comput. Optim. Appl. 53(2): 505-526 (2012) - [j16]Giampaolo Liuzzi
A decomposition algorithm for unconstrained optimization problems with partial derivative information. Optim. Lett. 6(3): 437-450 (2012) - [j15]David Di Lorenzo, Giampaolo Liuzzi
A concave optimization-based approach for sparse portfolio selection. Optim. Methods Softw. 27(6): 983-1000 (2012) - 2011
- [j14]Daniela di Serafino
A Modified DIviding RECTangles Algorithm for a Problem in Astrophysics. J. Optim. Theory Appl. 151(1): 175-190 (2011) - [j13]Giampaolo Liuzzi
On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds. Optim. Lett. 5(2): 347-362 (2011) - 2010
- [j12]Paola Bertolazzi, Concettina Guerra, Giampaolo Liuzzi
A global optimization algorithm for protein surface alignment. BMC Bioinform. 11: 488 (2010) - [j11]Gianni Di Pillo
A truncated Newton method in an augmented Lagrangian framework for nonlinear programming. Comput. Optim. Appl. 45(2): 311-352 (2010) - [j10]Giampaolo Liuzzi
A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems. Comput. Optim. Appl. 45(2): 353-375 (2010) - [j9]Giampaolo Liuzzi
A partition-based global optimization algorithm. J. Glob. Optim. 48(1): 113-128 (2010) - [j8]Giampaolo Liuzzi
Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization. SIAM J. Optim. 20(5): 2614-2635 (2010)
2000 – 2009
- 2009
- [j7]Giampaolo Liuzzi
A Derivative-Free Algorithm for Inequality Constrained Nonlinear Programming via Smoothing of an linfty Penalty Function. SIAM J. Optim. 20(1): 1-29 (2009) - 2008
- [j6]Giampaolo Liuzzi
A derivative-free algorithm for systems of nonlinear inequalities. Optim. Lett. 2(4): 521-534 (2008) - 2006
- [j5]Giampaolo Liuzzi
A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems. SIAM J. Optim. 16(4): 1054-1075 (2006) - 2005
- [j4]Giampaolo Liuzzi
Design of induction motors using a mixed-variable approach. Comput. Manag. Sci. 2(3): 213-228 (2005) - 2004
- [j3]Giampaolo Liuzzi
A magnetic resonance device designed via global optimization techniques. Math. Program. 101(2): 339-364 (2004) - 2003
- [j2]Gianni Di Pillo
An Exact Augmented Lagrangian Function for Nonlinear Programming with Two-Sided Constraints. Comput. Optim. Appl. 25(1-3): 57-83 (2003) - [j1]Francisco Facchinei
A Truncated Newton Method for the Solution of Large-Scale Inequality Constrained Minimization Problems. Comput. Optim. Appl. 25(1-3): 85-122 (2003)
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-04-25 05:58 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: