default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonio Leitão
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]Joel C. Rabelo, Antonio Leitão, Alexandre L. Madureira:
On inertial iterated Tikhonov methods for solving ill-posed problems. CoRR abs/2401.15213 (2024)- [i8]Antonio Leitão, Joel C. Rabelo, Dirk A. Lorenz, Maximilian Winkler:
On inertial Levenberg-Marquardt type methods for solving nonlinear ill-posed operator equations. CoRR abs/2406.07044 (2024) - 2021
- [i7]Antonio Leitão, M. Marques Alves:
On level set type methods for elliptic Cauchy problems. CoRR abs/2101.10725 (2021) - 2020
- [i6]Johann Baumeister, Barbara Kaltenbacher, Antonio Leitão:
On Levenberg-Marquardt-Kaczmarz iterative methods for solving systems of nonlinear ill-posed equations. CoRR abs/2011.09674 (2020) - [i5]Martin Burger, Heinz W. Engl, Antonio Leitão, Peter A. Markowich:
On inverse problems for semiconductor equations. CoRR abs/2011.11370 (2020) - [i4]Johann Baumeister, Antonio Leitão:
On iterative methods for solving ill-posed problems modeled by PDE's. CoRR abs/2011.14441 (2020) - [i3]Johann Baumeister, Antonio Leitão:
Optimal exploitation of renewable resource stocks: Necessary conditions. CoRR abs/2012.00609 (2020) - [i2]Juan P. Agnelli, A. De Cezaro, Antonio Leitão, M. Marques Alves:
On the identification of piecewise constant coefficients in optical diffusion tomography by level set. CoRR abs/2012.11980 (2020) - [i1]Johann Baumeister, A. De Cezaro, Antonio Leitão:
Modified iterated Tikhonov methods for solving systems of nonlinear ill-posed equations. CoRR abs/2012.11985 (2020)
2010 – 2019
- 2010
- [j4]Kees van den Doel, Uri M. Ascher, Antonio Leitão
:
Multiple Level Sets for Piecewise Constant Surface Reconstruction in Highly Ill-Posed Problems. J. Sci. Comput. 43(1): 44-66 (2010)
2000 – 2009
- 2009
- [c2]Adriano DeCezaro, Antonio Leitão, Xue-Cheng Tai:
On Level-Set Type Methods for Recovering Piecewise Constant Solutions of Ill-Posed Problems. SSVM 2009: 50-62 - 2008
- [j3]A. De Cezaro, Markus Haltmeier, Antonio Leitão, Otmar Scherzer:
On Steepest-Descent-Kaczmarz methods for regularizing systems of nonlinear ill-posed equations. Appl. Math. Comput. 202(2): 596-607 (2008) - 2007
- [j2]Johann Baumeister, Antonio Leitão, Geraldo Nunes Silva:
On the value function for nonautonomous optimal control problems with infinite horizon. Syst. Control. Lett. 56(3): 188-196 (2007) - 2005
- [j1]Florian Frühauf, Otmar Scherzer, Antonio Leitão:
Analysis of Regularization Methods for the Solution of Ill-Posed Problems Involving Discontinuous Operators. SIAM J. Numer. Anal. 43(2): 767-786 (2005) - 2001
- [c1]Johann Baumeister, Antonio Leitão:
Necessary conditions for an impulsive optimal control problem. ECC 2001: 912-916
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-07-09 21:14 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:
