default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefania Bellavia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Fabrizio Argenti
, Stefania Bellavia, Marco Fontani, Gabriele Guarnieri, Martino Jerian, Alberto Limone, Simone Rebegoldi:
A Proposed Workflow for the Restoration of Image Artifacts in Forensic Applications. IEEE Access 12: 88303-88321 (2024)- 2023
- [j34]Stefania Bellavia, Benedetta Morini, Simone Rebegoldi:
On the Convergence Properties of a Stochastic Trust-Region Method with Inexact Restoration. Axioms 12(1): 38 (2023) - [j33]Stefania Bellavia, Natasa Krejic, Benedetta Morini, Simone Rebegoldi:
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization. Comput. Optim. Appl. 84(1): 53-84 (2023) - [j32]Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint:
The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case. J. Optim. Theory Appl. 196(2): 700-729 (2023) - [i9]Stefania Bellavia, Davide Palitta, Margherita Porcelli, Valeria Simoncini:
Regularized methods via cubic subspace minimization for nonconvex optimization. CoRR abs/2306.14290 (2023) - [i8]Stefania Bellavia, Greta Malaspina, Benedetta Morini:
Inexact Newton methods with matrix approximation by sampling for nonlinear least-squares and systems. CoRR abs/2310.05501 (2023) - [i7]Stefania Bellavia, Francesco Della Santa, Alessandra Papini:
Alternate Training of Shared and Task-Specific Parameters for Multi-Task Neural Networks. CoRR abs/2312.16340 (2023) - 2022
- [j31]Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint:
Trust-region algorithms: Probabilistic complexity and intrinsic noise with applications to subsampling techniques. EURO J. Comput. Optim. 10: 100043 (2022) - [j30]Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint:
Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives. J. Complex. 68: 101591 (2022) - 2021
- [j29]Stefania Bellavia, Jacek Gondzio, Margherita Porcelli:
A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion. J. Sci. Comput. 89(2): 46 (2021) - [c3]Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint:
Quadratic and Cubic Regularisation Methods with Inexact function and Random Derivatives for Finite-Sum Minimisation. ICCSA (Workshops) 2021: 258-267 - [i6]Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint:
Quadratic and Cubic Regularisation Methods with Inexact function and Random Derivatives for Finite-Sum Minimisation. CoRR abs/2104.00592 (2021) - [i5]Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint:
The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case. CoRR abs/2104.02519 (2021) - [i4]Stefania Bellavia, Natasa Krejic, Benedetta Morini, Simone Rebegoldi:
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization. CoRR abs/2107.03129 (2021) - 2020
- [j28]Stefania Bellavia, Natasa Krejic, Benedetta Morini:
Inexact restoration with subsampled trust-region methods for finite-sum minimization. Comput. Optim. Appl. 76(3): 701-736 (2020) - [i3]Stefania Bellavia, Gianmarco Gurioli:
Complexity Analysis of a Stochastic Cubic Regularisation Method under Inexact Gradient Evaluations and Dynamic Hessian Accuracy. CoRR abs/2001.10827 (2020)
2010 – 2019
- 2019
- [j27]Stefania Bellavia, Jacek Gondzio, Margherita Porcelli:
An inexact dual logarithmic barrier method for solving sparse semidefinite programs. Math. Program. 178(1-2): 109-143 (2019) - [j26]Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint:
Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization. SIAM J. Optim. 29(4): 2881-2915 (2019) - [i2]Stefania Bellavia, Jacek Gondzio, Margherita Porcelli:
A relaxed interior point method for low-rank semidefinite programming problems. CoRR abs/1909.06099 (2019) - 2018
- [j25]Stefania Bellavia, Elisa Riccietti:
On an Elliptical Trust-Region Procedure for Ill-Posed Nonlinear Least-Squares Problems. J. Optim. Theory Appl. 178(3): 824-859 (2018) - [j24]Stefania Bellavia, Serge Gratton, Elisa Riccietti:
A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients. Numerische Mathematik 140(3): 791-825 (2018) - [i1]Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint:
Deterministic and stochastic inexact regularization algorithms for nonconvex optimization with optimal complexity. CoRR abs/1811.03831 (2018) - 2016
- [j23]Stefania Bellavia, Benedetta Morini, Elisa Riccietti:
On an adaptive regularization for ill-posed nonlinear systems and its trust-region implementation. Comput. Optim. Appl. 64(1): 1-30 (2016) - [j22]Stefania Bellavia, Valentina De Simone, Daniela di Serafino, Benedetta Morini:
On the update of constraint preconditioners for regularized KKT systems. Comput. Optim. Appl. 65(2): 339-360 (2016) - 2015
- [j21]Stefania Bellavia, Sandra Pieraccini:
On affine-scaling inexact dogleg methods for bound-constrained nonlinear systems. Optim. Methods Softw. 30(2): 276-300 (2015) - [j20]Stefania Bellavia, Valentina De Simone, Daniela di Serafino, Benedetta Morini:
Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections. SIAM J. Optim. 25(3): 1787-1808 (2015) - 2014
- [j19]Stefania Bellavia, Benedetta Morini, Margherita Porcelli:
New updates of incomplete LU factorizations and applications to large nonlinear systems. Optim. Methods Softw. 29(2): 321-340 (2014) - 2013
- [j18]Stefania Bellavia, Jacek Gondzio, Benedetta Morini:
A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems. SIAM J. Sci. Comput. 35(1) (2013) - 2012
- [j17]Stefania Bellavia, Maria Macconi, Sandra Pieraccini:
Constrained Dogleg methods for nonlinear systems with simple bounds. Comput. Optim. Appl. 53(3): 771-794 (2012) - [j16]Stefania Bellavia, Valentina De Simone, Daniela di Serafino, Benedetta Morini:
A Preconditioning Framework for Sequences of Diagonally Modified Linear Systems Arising in Optimization. SIAM J. Numer. Anal. 50(6): 3280-3302 (2012) - 2011
- [j15]Stefania Bellavia, Silvia Magheri, Claudia Miani:
Inexact Newton methods for model simulation. Int. J. Comput. Math. 88(14): 2969-2987 (2011) - [j14]Stefania Bellavia, Jacek Gondzio, Benedetta Morini:
Computational experience with numerical methods for nonnegative least-squares problems. Numer. Linear Algebra Appl. 18(3): 363-385 (2011) - [j13]Stefania Bellavia, Valentina De Simone, Daniela di Serafino, Benedetta Morini:
Efficient Preconditioner Updates for Shifted Linear Systems. SIAM J. Sci. Comput. 33(4): 1785-1809 (2011) - [j12]Stefania Bellavia, Daniele Bertaccini, Benedetta Morini:
Nonsymmetric Preconditioner Updates in Newton-Krylov Methods for Nonlinear Systems. SIAM J. Sci. Comput. 33(5): 2595-2619 (2011) - 2010
- [j11]Stefania Bellavia, Coralia Cartis, Nicholas I. M. Gould, Benedetta Morini, Philippe L. Toint:
Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares. SIAM J. Numer. Anal. 48(1): 1-29 (2010)
2000 – 2009
- 2009
- [j10]Stefania Bellavia, Sandra Pieraccini:
Numerical solution of KKT systems in PDE-constrained optimization problems via the affine scaling trust-region approach. Int. J. Comput. Math. 86(12): 2122-2142 (2009) - [j9]Stefania Bellavia, Jacek Gondzio, Benedetta Morini:
Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems. Numer. Linear Algebra Appl. 16(1): 39-61 (2009) - 2007
- [j8]Stefania Bellavia, Stefano Berrone:
Globalization strategies for Newton-Krylov methods for stabilized FEM discretization of Navier-Stokes equations. J. Comput. Phys. 226(2): 2317-2340 (2007) - 2006
- [j7]Stefania Bellavia, Maria Macconi, Benedetta Morini:
An interior point Newton-like method for non-negative least-squares problems with degenerate solution. Numer. Linear Algebra Appl. 13(10): 825-846 (2006) - [j6]Stefania Bellavia, Benedetta Morini:
Subspace Trust-Region Methods for Large Bound-Constrained Nonlinear Equations. SIAM J. Numer. Anal. 44(4): 1535-1555 (2006) - [c2]Stefania Bellavia, Stefano Lodi, Benedetta Morini:
Inferences on Kernel Density Estimates by Solving Nonlinear Systems. SSDBM 2006: 389-397 - 2005
- [j5]Stefania Bellavia, Benedetta Morini:
An interior global method for nonlinear systems with simple bounds. Optim. Methods Softw. 20(4-5): 453-474 (2005) - 2004
- [j4]Stefania Bellavia, Maria Macconi, Benedetta Morini:
STRSCNE: A Scaled Trust-Region Solver for Constrained Nonlinear Equations. Comput. Optim. Appl. 28(1): 31-50 (2004) - [j3]Stefania Bellavia, Sandra Pieraccini:
Convergence Analysis of an Inexact Infeasible Interior Point Method for Semidefinite Programming. Comput. Optim. Appl. 29(3): 289-313 (2004) - 2001
- [j2]Stefania Bellavia, Benedetta Morini:
A Globally Convergent Newton-GMRES Subspace Method for Systems of Nonlinear Equations. SIAM J. Sci. Comput. 23(3): 940-960 (2001) - 2000
- [c1]Stefania Bellavia, Maria Macconi, Benedetta Morini:
A Hybrid Newton-GMRES Method for Solving Nonlinear Equations. NAA 2000: 68-75
1990 – 1999
- 1998
- [j1]Stefania Bellavia, Maria Macconi, Benedetta Morini:
The Switching-Method in Multiple Shooting. Computing 60(3): 275-283 (1998)
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-20 21:16 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:
