Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Alessandra Papini"'
In this work we consider the Takagi factorization of a matrix valued function depending on parameters. We give smoothness and genericity results and pay particular attention to the concerns caused by having either a singular value equal to $0$ or mul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6f485d988662a14b4e525333d49d576d
http://arxiv.org/abs/2110.15918
http://arxiv.org/abs/2110.15918
We present a derivative-free method for solving systems of nonlinear equations that belongs to the class of spectral residual methods. We will show that by endowing a previous version of the algorithm with a suitable new linesearch strategy, standard
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff0fd8ab62ef6950a7fac3596ed2a0c4
http://hdl.handle.net/2158/1218828
http://hdl.handle.net/2158/1218828
Publikováno v:
Numerical Algorithms. 80:1241-1266
In this work, we develop and implement new numerical methods to locate generic degeneracies (i.e., isolated parameters’ values where the eigenvalues coalesce) of banded matrix valued functions. More precisely, our specific interest is in two classe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::428239d5bdb09f5f0b4884fd43af2579
https://doi.org/10.1007/s11075-018-0525-z
https://doi.org/10.1007/s11075-018-0525-z
Autor:
Emanuele Frandi, Alessandra Papini
Publikováno v:
Optimization Methods and Software. 30:1077-1094
Direct Search algorithms are classical derivative-free methods for optimization. Though endowed with solid theoretical properties, they are not well suited for large-scale problems due to slow convergence and scaling issues. In this paper, we discuss
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47174868e0d83e70bab10abe4c959f82
https://doi.org/10.1080/10556788.2015.1014555
https://doi.org/10.1080/10556788.2015.1014555
Shape from shading (SFS) denotes the problem of reconstructing a 3D surface, starting from a single shaded image which represents the surface itself. Minimization techniques are commonly used for solving the SFS problem, where the objective function
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd91455a118de4420898e313d2241913
http://hdl.handle.net/2158/1087697
http://hdl.handle.net/2158/1087697
Autor:
Alessandra Papini, Emanuele Frandi
Publikováno v:
Optimization Methods and Software. 29:1020-1041
Many optimization problems of practical interest arise from the discretization of continuous problems. Classical examples can be found in calculus of variations, optimal control and image processing. In the recent years a number of strategies have be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd33baa41797f44452e5d4f59c7ae9d4
https://doi.org/10.1080/10556788.2013.841691
https://doi.org/10.1080/10556788.2013.841691
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 34:519-541
We consider a Hermitian matrix valued function $A(x)\in \mathbb{C}^{n\times n}$, smoothly depending on parameters $x\in \Omega\subset \mathbb{R}^3$, where $\Omega$ is an open bounded region of ${\mathbb R}^3$. We develop an algorithm to locate parame
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a94e5ae00c3e019bc387055d18e1b10
https://doi.org/10.1137/120898036
https://doi.org/10.1137/120898036
Publikováno v:
Mathematics and Computers in Simulation. 81:996-1005
Consider a matrix valued function A(x)@?R^m^x^n, m>=n, smoothly depending on parameters x@?@W@?R^2, where @W is simply connected and bounded. We consider a technique to locate parameter values where some of the q dominant (q@?n) singular values of A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52bc0ff13ebf04588012e54cdf4aa8c7
https://doi.org/10.1016/j.matcom.2010.10.005
https://doi.org/10.1016/j.matcom.2010.10.005
Publikováno v:
Journal of Computational and Applied Mathematics. 229(1):283-293
We propose a Generalized Pattern Search (GPS) method to solve a class of nonsmooth minimization problems, where the set of nondifferentiability is included in the union of known hyperplanes and, therefore, is highly structured. Both unconstrained and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3385b60312f8d4a2255d42da87f2d4f6
Publikováno v:
SIAM Journal on Optimization. 20:321-335
We consider a direct search approach for solving nonsmooth minimization problems where the objective function is locally Lipschitz continuous and piecewise continuously differentiable on a finite family of polyhedra. A generating set search method is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94a2255d774b3e98ac361cb94819f6be
https://doi.org/10.1137/070708032
https://doi.org/10.1137/070708032