default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatteo Rocca
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Davide La Torre
, Franklin Mendivil, Matteo Rocca:
Modeling portfolio efficiency using stochastic optimization with incomplete information and partial uncertainty. Ann. Oper. Res. 334(1): 241-263 (2024)- [j13]Davide La Torre, Danilo Liuzzi, Marco Repetto, Matteo Rocca:
Enhancing deep learning algorithm accuracy and stability using multicriteria optimization: an application to distributed learning with MNIST digits. Ann. Oper. Res. 339(1-2): 455-475 (2024) - 2021
- [j12]Elisa Mastrogiacomo, Matteo Rocca:
Set optimization of set-valued risk measures. Ann. Oper. Res. 296(1): 291-314 (2021) - [j11]Giovanni Paolo Crespi, Andreas H. Hamel, Matteo Rocca, Carola Schrage:
Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization. Math. Oper. Res. 46(1): 361-381 (2021) - [i2]Davide La Torre, Danilo Liuzzi, Marco Repetto, Matteo Rocca:
Mixing Deep Learning and Multiple Criteria Optimization: An Application to Distributed Learning with Multiple Datasets. CoRR abs/2112.01358 (2021) - 2020
- [j10]Giovanni Paolo Crespi, Daishi Kuroiwa, Matteo Rocca:
Robust Nash equilibria in vector-valued games with uncertainty. Ann. Oper. Res. 289(2): 185-193 (2020) - [j9]Fabio Tosi, Matteo Rocca, Filippo Aleotti, Matteo Poggi, Stefano Mattoccia, Flavia Tauro, Elena Toth, Salvatore Grimaldi:
Enabling Image-Based Streamflow Monitoring at the Edge. Remote. Sens. 12(12): 2047 (2020) - [i1]Giovanni Paolo Crespi, Davide Radi, Matteo Rocca:
Insights on the Theory of Robust Games. CoRR abs/2002.00225 (2020)
2010 – 2019
- 2017
- [j8]Giovanni Paolo Crespi, Daishi Kuroiwa, Matteo Rocca:
Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization. Ann. Oper. Res. 251(1-2): 89-104 (2017) - 2015
- [j7]Giovanni Paolo Crespi, Matteo Rocca, Carola Schrage:
Variational Inequalities Characterizing Weak Minimality in Set Optimization. J. Optim. Theory Appl. 166(3): 804-824 (2015) - 2010
- [j6]Ivan Ginchev, Angelo Guerraggio, Matteo Rocca:
Second-order Dini set-valued directional derivative in C 1, 1 vector optimization. Optim. Methods Softw. 25(1): 75-87 (2010)
2000 – 2009
- 2006
- [j5]Giovanni Paolo Crespi, Ivan Ginchev, Matteo Rocca:
First-order optimality conditions in set-valued optimization. Math. Methods Oper. Res. 63(1): 87-106 (2006) - 2005
- [j4]Giovanni Paolo Crespi, Ivan Ginchev, Matteo Rocca:
Existence of Solutions and Star-shapedness in Minty Variational Inequalities. J. Glob. Optim. 32(4): 485-494 (2005) - [j3]Ivan Ginchev, Angelo Guerraggio, Matteo Rocca:
Second-order conditions in C1, 1 constrained vector optimization. Math. Program. 104(2-3): 389-405 (2005) - [j2]Giovanni Paolo Crespi, Ivan Ginchev, Matteo Rocca:
A note on Minty type vector variational inequalities. RAIRO Oper. Res. 39(4): 253-273 (2005) - 2004
- [j1]Davide La Torre, Matteo Rocca:
Mean value theorem for continuous vector functions by smooth approximations. Appl. Math. Lett. 17(7): 791-794 (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-10-07 22:19 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:
