default search action
Simone Sagratella
2020 – today
- 2025
- [j26]Lorenzo Lampariello, Simone Sagratella, Valerio Giuseppe Sasso:
Addressing Hierarchical Jointly Convex Generalized Nash Equilibrium Problems with Nonsmooth Payoffs. SIAM J. Optim. 35(1): 445-475 (2025) - 2023
- [j25]Francesco Cesarone, Lorenzo Lampariello
, Davide Merolla, Jacopo M. Ricci
A bilevel approach to ESG multi-portfolio selection. Comput. Manag. Sci. 20(1): 24 (2023) - [j24]Giancarlo Bigi
Approximate variational inequalities and equilibria. Comput. Manag. Sci. 20(1): 43 (2023) - [i5]Filippo Fabiani, Simone Sagratella:
On best-response algorithms for monotone Nash equilibrium problems with mixed-integer variables. CoRR abs/2310.09885 (2023) - 2022
- [j23]Lorenzo Lampariello
On the solution of monotone nested variational inequalities. Math. Methods Oper. Res. 96(3): 421-446 (2022) - [c5]Filippo Fabiani, Barbara Franci
Proximal-like algorithms for equilibrium seeking in mixed-integer Nash equilibrium problems. CDC 2022: 4137-4142 - [i4]Filippo Fabiani, Barbara Franci, Simone Sagratella, Martin Schmidt, Mathias Staudigl:
Proximal-like algorithms for equilibrium seeking in mixed-integer Nash equilibrium problems. CoRR abs/2203.15410 (2022) - 2021
- [j22]Lorenzo Lampariello
Equilibrium selection for multi-portfolio optimization. Eur. J. Oper. Res. 295(1): 363-373 (2021) - 2020
- [j21]Lorenzo Lampariello
Numerically tractable optimistic bilevel problems. Comput. Optim. Appl. 76(2): 277-303 (2020) - [j20]Lorenzo Lampariello
An explicit Tikhonov algorithm for nested variational inequalities. Comput. Optim. Appl. 77(2): 335-350 (2020) - [j19]Simone Sagratella, Marcel Schmidt, Nathan Sudermann-Merx:
The noncooperative fixed charge transportation problem. Eur. J. Oper. Res. 284(1): 373-382 (2020) - [j18]Tommaso Colombo
Distributed algorithms for convex problems with linear coupling constraints. J. Glob. Optim. 77(1): 53-73 (2020) - [j17]Yekini Shehu
Inertial Projection-Type Methods for Solving Quasi-Variational Inequalities in Real Hilbert Spaces. J. Optim. Theory Appl. 184(3): 877-894 (2020) - [j16]Axel Dreves
Nonsingularity and Stationarity Results for Quasi-Variational Inequalities. J. Optim. Theory Appl. 185(3): 711-743 (2020)
2010 – 2019
- 2019
- [j15]Andrea Manno
Case Article - Production and Distribution Optimization of Beach Equipment for the Marinero Company. INFORMS Trans. Educ. 19(3): 152-154 (2019) - [j14]Andrea Manno
Case - Production and Distribution Optimization of Beach Equipment for the Marinero Company. INFORMS Trans. Educ. 19(3): 155-159 (2019) - [j13]Lorenzo Lampariello
The Standard Pessimistic Bilevel Problem. SIAM J. Optim. 29(2): 1634-1656 (2019) - [c4]Francesco Foglino, Matteo Leonetti
A Gray-Box Approach for Curriculum Learning. WCGO 2019: 720-729 - [i3]Francesco Foglino, Matteo Leonetti, Simone Sagratella, Ruggiero Seccia:
A gray-box approach for curriculum learning. CoRR abs/1906.06812 (2019) - 2018
- [j12]Andrea Manno
Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training. Comput. Optim. Appl. 71(1): 115-145 (2018) - 2017
- [j11]Simone Sagratella
Algorithms for generalized potential games with mixed-integer variables. Comput. Optim. Appl. 68(3): 689-717 (2017) - [j10]Lorenzo Lampariello
A Bridge Between Bilevel Programs and Nash Games. J. Optim. Theory Appl. 174(2): 613-635 (2017) - [j9]Didier Aussel
Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality. Math. Methods Oper. Res. 85(1): 3-18 (2017) - [j8]Simone Sagratella
Computing equilibria of Cournot oligopoly models with mixed-integer quantities. Math. Methods Oper. Res. 86(3): 549-565 (2017) - 2016
- [j7]Vittorio Latorre
A canonical duality approach for the solution of affine quasi-variational inequalities. J. Glob. Optim. 64(3): 433-449 (2016) - [j6]Simone Sagratella:
Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets. SIAM J. Optim. 26(4): 2190-2218 (2016) - [c3]Andrea Manno
A convergent and fully distributable SVMs training algorithm. IJCNN 2016: 3076-3080 - 2015
- [j5]Francisco Facchinei
The semismooth Newton method for the solution of quasi-variational inequalities. Comput. Optim. Appl. 62(1): 85-109 (2015) - [j4]Francisco Facchinei
Parallel Selective Algorithms for Nonconvex Big Data Optimization. IEEE Trans. Signal Process. 63(7): 1874-1889 (2015) - 2014
- [j3]Francisco Facchinei
Solving quasi-variational inequalities via their KKT conditions. Math. Program. 144(1-2): 369-412 (2014) - [c2]Francisco Facchinei
Flexible parallel algorithms for big data optimization. ICASSP 2014: 7208-7212 - [i2]Francisco Facchinei, Simone Sagratella, Gesualdo Scutari:
Parallel Algorithms for Big Data Optimization. CoRR abs/1402.5521 (2014) - 2013
- [i1]Francisco Facchinei, Simone Sagratella, Gesualdo Scutari:
Flexible Parallel Algorithms for Big Data Optimization. CoRR abs/1311.2444 (2013) - 2011
- [j2]Francisco Facchinei
On the computation of all solutions of jointly convex generalized Nash equilibrium problems. Optim. Lett. 5(3): 531-547 (2011) - [j1]Axel Dreves
On the solution of the KKT conditions of generalized Nash equilibrium problems. SIAM J. Optim. 21(3): 1082-1108 (2011) - [c1]Silvia Canale, Alberto De Santis, Daniela Iacoviello
Integrating X-SAR images and anthropic factors for fire susceptibility assessment. IGARSS 2011: 818-821
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.
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.
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.
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 2025-03-24 00:30 CET 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: