![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
María Laura Schuverdt
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Roberto Andreani, María Laura Schuverdt, Leonardo D. Secchin
:
On Enhanced KKT Optimality Conditions for Smooth Nonlinear Optimization. SIAM J. Optim. 34(2): 1515-1539 (2024) - 2022
- [j11]Roberto Andreani, Gabriel Haeser, María Laura Schuverdt, Leonardo D. Secchin
, Paulo J. S. Silva:
On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees. Math. Program. Comput. 14(1): 121-146 (2022)
2010 – 2019
- 2019
- [j10]Nadia S. Fazzio, María Laura Schuverdt:
Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems. Optim. Lett. 13(6): 1365-1379 (2019) - [j9]Roberto Andreani, Nadia S. Fazzio, María Laura Schuverdt, Leonardo D. Secchin
:
A Sequential Optimality Condition Related to the Quasi-normality Constraint Qualification and Its Algorithmic Consequences. SIAM J. Optim. 29(1): 743-766 (2019) - 2016
- [j8]Nélida E. Echebest, María Daniela Sánchez, María Laura Schuverdt:
Convergence Results of an Augmented Lagrangian Method Using the Exponential Penalty Function. J. Optim. Theory Appl. 168(1): 92-108 (2016) - 2012
- [j7]Nélida E. Echebest, María Laura Schuverdt, R. P. Vignau:
A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations. Appl. Math. Comput. 219(6): 3198-3208 (2012) - [j6]Roberto Andreani, Gabriel Haeser
, María Laura Schuverdt, Paulo J. S. Silva
:
A relaxed constant positive linear dependence constraint qualification and applications. Math. Program. 135(1-2): 255-273 (2012) - [j5]Roberto Andreani, Gabriel Haeser
, María Laura Schuverdt, Paulo J. S. Silva
:
Two New Weak Constraint Qualifications and Applications. SIAM J. Optim. 22(3): 1109-1135 (2012) - 2011
- [j4]Gabriel Haeser
, María Laura Schuverdt:
On Approximate KKT Condition and its Extension to Continuous Variational Inequalities. J. Optim. Theory Appl. 149(3): 528-539 (2011) - 2010
- [j3]Roberto Andreani, Ernesto G. Birgin
, José Mario Martínez
, María Laura Schuverdt:
Second-order negative-curvature methods for box-constrained and general constrained optimization. Comput. Optim. Appl. 45(2): 209-236 (2010)
2000 – 2009
- 2008
- [j2]Roberto Andreani, Ernesto G. Birgin
, José Mario Martínez
, María Laura Schuverdt:
Augmented Lagrangian methods under the constant positive linear dependence constraint qualification. Math. Program. 111(1-2): 5-32 (2008) - 2007
- [j1]Roberto Andreani, Ernesto G. Birgin
, José Mario Martínez
, María Laura Schuverdt:
On Augmented Lagrangian Methods with General Lower-Level Constraints. SIAM J. Optim. 18(4): 1286-1309 (2007)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-05-19 01:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint