default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValentina Sessa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Welington de Oliveira, Valentina Sessa, David Sossa
:
Computing Critical Angles Between Two Convex Cones. J. Optim. Theory Appl. 201(2): 866-898 (2024)- [c6]Sophie Demassey, Valentina Sessa, Amirhossein Tavakoli:
Alternating Direction Method and Deep Learning for Discrete Control with Storage. ISCO 2024: 85-96 - 2022
- [j6]Joaquim Júdice, Valentina Sessa, Masao Fukushima:
Solution of Fractional Quadratic Programs on the Simplex and Application to the Eigenvalue Complementarity Problem. J. Optim. Theory Appl. 193(1): 545-573 (2022) - 2021
- [j5]Joaquim João Júdice, Masao Fukushima, Alfredo N. Iusem, José Mario Martínez, Valentina Sessa:
An alternating direction method of multipliers for the eigenvalue complementarity problem. Optim. Methods Softw. 36(2-3): 337-370 (2021) - 2020
- [j4]Masao Fukushima, Joaquim Júdice, Welington de Oliveira, Valentina Sessa:
A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem. Comput. Optim. Appl. 77(3): 711-728 (2020)
2010 – 2019
- 2019
- [j3]Alfredo N. Iusem, Joaquim João Júdice, Valentina Sessa, Paula Sarabando:
Splitting methods for the Eigenvalue Complementarity Problem. Optim. Methods Softw. 34(6): 1184-1212 (2019) - [j2]Valentina Sessa, Luigi Rubino, Luigi Iannelli, Francesco Vasca, Pompeo Marino:
Complementarity Model for Steady-State Analysis of Resonant LLC Power Converters. IEEE Trans. Circuits Syst. II Express Briefs 66-II(7): 1182-1186 (2019) - 2016
- [j1]Alfredo N. Iusem, Joaquim João Júdice, Valentina Sessa, Hanif D. Sherali:
On the numerical solution of the quadratic eigenvalue complementarity problem. Numer. Algorithms 72(3): 721-747 (2016) - [c5]Valentina Sessa, Luís F. C. Monteiro, Douglas Mota Dias:
A single-phase active filter with cascaded multilevel inverter modelled as a complementarity problem. IECON 2016: 1075-1080 - 2014
- [c4]W. P. M. H. Heemels, Valentina Sessa, Francesco Vasca, M. Kanat Camlibel:
Time-stepping methods for constructing periodic solutions in maximally monotone set-valued dynamical systems. CDC 2014: 3095-3100 - 2013
- [c3]Valentina Sessa, Luigi Iannelli, Vincent Acary, Bernard Brogliato, Francesco Vasca:
Computing period and shape of oscillations in piecewise linear Lur'e systems: A complementarity approach. CDC 2013: 4680-4685 - 2012
- [c2]Valentina Sessa, Luigi Iannelli, Francesco Vasca:
Mixed linear complementarity problems for the analysis of limit cycles in piecewise linear systems. CDC 2012: 1023-1028 - 2011
- [c1]Luigi Iannelli, Francesco Vasca, Valentina Sessa:
Computation of limit cycles in Lur'e systems. ACC 2011: 1402-1407
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 2025-01-21 00:02 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:
