default search action
Marco Sciandrone
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j49]Matteo Lapucci
, Tommaso Levato
A Unifying Framework for Sparsity-Constrained Optimization. J. Optim. Theory Appl. 199(2): 663-692 (2023) - 2022
- [j48]Riccardo Bisori, Matteo Lapucci
A study on sequential minimal optimization methods for standard quadratic problems. 4OR 20(4): 685-712 (2022) - [j47]Veronica Piccialli
Nonlinear optimization and support vector machines. Ann. Oper. Res. 314(1): 15-47 (2022) - 2021
- [j46]Giulio Galvan
A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints. Comput. Optim. Appl. 80(1): 33-53 (2021) - [j45]Giulio Galvan, Matteo Lapucci, Chih-Jen Lin, Marco Sciandrone:
A Two-Level Decomposition Framework Exploiting First and Second Order Information for SVM Training Problems. J. Mach. Learn. Res. 22: 23:1-23:38 (2021) - [j44]Matteo Lapucci
Convergent Inexact Penalty Decomposition Methods for Cardinality-Constrained Problems. J. Optim. Theory Appl. 188(2): 473-496 (2021) - 2020
- [j43]Leonardo Galli
A unified convergence framework for nonmonotone inexact decomposition methods. Comput. Optim. Appl. 75(1): 113-144 (2020) - [j42]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) - [j41]Guido Cocchi
A concave optimization-based approach for sparse multiobjective programming. Optim. Lett. 14(3): 535-556 (2020) - [j40]Giulio Galvan
An Alternating Augmented Lagrangian method for constrained nonconvex optimization. Optim. Methods Softw. 35(3): 502-520 (2020)
2010 – 2019
- 2019
- [j39]Alessandro Galligari
A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand. Comput. Oper. Res. 103: 158-166 (2019) - 2018
- [j38]Veronica Piccialli
Nonlinear optimization and support vector machines. 4OR 16(2): 111-149 (2018) - [j37]Guido Cocchi
An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints. Comput. Optim. Appl. 69(2): 267-296 (2018) - [j36]Leonardo Galli
A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties. Comput. Optim. Appl. 69(3): 629-652 (2018) - [j35]Guido Cocchi
Scheduling the Italian National Volleyball Tournament. Interfaces 48(3): 271-284 (2018) - [j34]Alessandro Galligari
A convergent and fast path equilibration algorithm for the traffic assignment problem. Optim. Methods Softw. 33(2): 354-371 (2018) - 2017
- [j33]Luca Bravi, Veronica Piccialli
An Optimization-Based Method for Feature Ranking in Nonlinear Regression Problems. IEEE Trans. Neural Networks Learn. Syst. 28(4): 1005-1010 (2017) - 2016
- [j32]Tommaso Bianconcini
A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques. Optim. Methods Softw. 31(5): 1008-1035 (2016) - [j31]Luigi Grippo, Andrea Manno
Decomposition Techniques for Multilayer Perceptron Training. IEEE Trans. Neural Networks Learn. Syst. 27(11): 2146-2159 (2016) - 2015
- [j30]Tommaso Bianconcini
On the use of iterative methods in cubic regularization for unconstrained optimization. Comput. Optim. Appl. 60(1): 35-57 (2015) - [j29]David Di Lorenzo, Alessandro Galligari
A convergent and efficient decomposition method for the traffic assignment problem. Comput. Optim. Appl. 60(1): 151-170 (2015) - 2014
- [j28]Luca Bravi, Marco Sciandrone:
An incremental decomposition method for unconstrained optimization. Appl. Math. Comput. 235: 80-86 (2014) - [j27]David Di Lorenzo, Mauro Passacantando
A convergent inexact solution method for equilibrium problems. Optim. Methods Softw. 29(5): 979-991 (2014) - 2013
- [j26]Andrea Cassioli, A. Chiavaioli, Costanzo Manes
An incremental least squares algorithm for large scale linear classification. Eur. J. Oper. Res. 224(3): 560-565 (2013) - [j25]Andrea Cassioli, David Di Lorenzo, Marco Sciandrone:
On the convergence of inexact block coordinate descent methods for constrained optimization. Eur. J. Oper. Res. 231(2): 274-281 (2013) - 2012
- [j24]Andrea Cassioli, David Di Lorenzo, Marco Locatelli
Machine learning for global optimization. Comput. Optim. Appl. 51(1): 279-303 (2012) - [j23]David Di Lorenzo, Giampaolo Liuzzi
A concave optimization-based approach for sparse portfolio selection. Optim. Methods Softw. 27(6): 983-1000 (2012) - 2011
- [j22]Francisco Facchinei
Decomposition algorithms for generalized potential games. Comput. Optim. Appl. 50(2): 237-262 (2011) - 2010
- [j21]Francesco Rinaldi
Concave programming for minimizing the zero-norm over polyhedral sets. Comput. Optim. Appl. 46(3): 467-486 (2010) - [j20]Francesco Rinaldi
Feature selection combining linear support vector machines and concave optimization. Optim. Methods Softw. 25(1): 117-128 (2010) - [j19]Luigi Grippo, Marco Sciandrone:
Nonmonotone globalization of the finite-difference Newton-GMRES method for nonlinear equations. Optim. Methods Softw. 25(6): 971-999 (2010) - [j18]Giampaolo Liuzzi
Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization. SIAM J. Optim. 20(5): 2614-2635 (2010) - [j17]Luigi Chisci
Real-Time Epileptic Seizure Prediction Using AR Models and Support Vector Machines. IEEE Trans. Biomed. Eng. 57(5): 1124-1132 (2010)
2000 – 2009
- 2009
- [j16]Andrea De Gaetano
A patient adaptable ECG beat classifier based on neural networks. Appl. Math. Comput. 213(1): 243-249 (2009) - [j15]Andrea Cassioli, Marco Sciandrone:
A convergent decomposition method for box-constrained optimization problems. Optim. Lett. 3(3): 397-409 (2009) - [j14]Stefano Lucidi
A Convergent Hybrid Decomposition Algorithm Model for SVM Training. IEEE Trans. Neural Networks 20(6): 1055-1060 (2009) - 2007
- [j13]Luigi Grippo, Marco Sciandrone:
Nonmonotone derivative-free methods for nonlinear equations. Comput. Optim. Appl. 37(3): 297-328 (2007) - [j12]Stefano Lucidi
A convergent decomposition algorithm for support vector machines. Comput. Optim. Appl. 38(2): 217-234 (2007) - 2006
- [j11]Giovanni Fasano
A Truncated Nonmonotone Gauss-Newton Method for Large-Scale Nonlinear Least-Squares Problems. Comput. Optim. Appl. 34(3): 343-358 (2006) - [j10]Giampaolo Liuzzi
A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems. SIAM J. Optim. 16(4): 1054-1075 (2006) - 2005
- [j9]Laura Palagi
On the convergence of a modified version of SVMlight algorithm. Optim. Methods Softw. 20(2-3): 317-334 (2005) - [j8]Stefano Lucidi
An Algorithm Model for Mixed Variable Programming. SIAM J. Optim. 15(4): 1057-1084 (2005) - 2002
- [j7]Stefano Lucidi
A Derivative-Free Algorithm for Bound Constrained Optimization. Comput. Optim. Appl. 21(2): 119-142 (2002) - [j6]Luigi Grippo, Marco Sciandrone:
Nonmonotone Globalization Techniques for the Barzilai-Borwein Gradient Method. Comput. Optim. Appl. 23(2): 143-169 (2002) - [j5]Stefano Lucidi
Objective-derivative-free methods for constrained optimization. Math. Program. 92(1): 37-59 (2002) - [j4]Stefano Lucidi
On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization. SIAM J. Optim. 13(1): 97-116 (2002) - 2001
- [j3]C. Buzzi, Luigi Grippo, Marco Sciandrone:
Convergent Decomposition Techniques for Training RBF Neural Networks. Neural Comput. 13(8): 1891-1920 (2001) - [j2]Francesco Lampariello, Marco Sciandrone:
Efficient training of RBF neural networks for pattern recognition. IEEE Trans. Neural Networks 12(5): 1235-1242 (2001) - 2000
- [j1]Luigi Grippo, Marco Sciandrone:
On the convergence of the block nonlinear Gauss-Seidel method under convex constraints. Oper. Res. Lett. 26(3): 127-136 (2000)
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-09-13 01:40 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: