Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Ron Estrin"'
Autor:
Ron Estrin, Michael P. Friedlander
Publikováno v:
Optimization Letters. 14:1989-2006
Level-set methods for convex optimization are predicated on the idea that certain problems can be parameterized so that their solutions can be recovered as the limiting process of a root-finding procedure. This idea emerges time and again across a ra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92d5b1b19059b8f71f2210a1b552faf1
https://doi.org/10.1007/s11590-020-01609-9
https://doi.org/10.1007/s11590-020-01609-9
Publikováno v:
SIAM Journal on Scientific Computing. 42:A1836-A1859
We build upon Estrin et al. (2019) to develop a general constrained nonlinear optimization algorithm based on a smooth penalty function proposed by Fletcher (1970, 1973b). Although Fletcher's approach has historically been considered impractical, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f65f30c4ae2ad27b2f965109377464b6
https://doi.org/10.1137/19m1255069
https://doi.org/10.1137/19m1255069
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 40:235-253
For positive definite and semidefinite consistent $Ax_\star=b$, we use the Gauss--Radau approach of Golub and Meurant (1997) to obtain an upper bound on the error $\|x_\star-x_k^L\|_2$ for SYMMLQ i...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95c68f54a2ad2807924fb57d96371487
https://doi.org/10.1137/16m1094816
https://doi.org/10.1137/16m1094816
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 40:1102-1124
We describe LNLQ for solving the least-norm problem min $\|x\|$ subject to $Ax=b$, using the Golub--Kahan bidiagonalization of $[b\ A]$. Craig's method is known to be equivalent to applying the con...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f5d410006c56cb89d0ae30b78cbaaf5
https://doi.org/10.1137/18m1194948
https://doi.org/10.1137/18m1194948
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 40:254-275
We propose an iterative method named LSLQ for solving linear least-squares problems of any shape. The method is based on the Golub and Kahan (1965) process, where the dominant cost consists in prod...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ce49975d4439aeb319b6b73f8861b7a
https://doi.org/10.1137/17m1113552
https://doi.org/10.1137/17m1113552
Autor:
Ron Estrin, Chen Greif
Publikováno v:
SIAM Journal on Scientific Computing. 40:A1884-A1914
We introduce a new family of saddle-point minimum residual methods for iteratively solving saddle-point systems using a minimum or quasi-minimum residual approach. No symmetry assumptions are made. The basic mechanism underlying the method is a novel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4bcaefe0098176d6ada42204b3b524d
https://doi.org/10.1137/16m1102410
https://doi.org/10.1137/16m1102410
Autor:
Chen Greif, Ron Estrin
Publikováno v:
Numerical Linear Algebra with Applications. 23:693-705
We present an analysis for minimizing the condition number of nonsingular parameter-dependent 2 2 block-structured saddle-point matrices with a maximally rank-deficient (1,1) block. The matrices arise from an augmented Lagrangian approach. Using quas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8e3cdeba3f6b68600e56b43503564c5
https://doi.org/10.1002/nla.2050
https://doi.org/10.1002/nla.2050
Autor:
Chen Greif, Ron Estrin
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 36:367-384
We consider nonsingular saddle-point matrices whose leading block is maximally rank deficient, and show that the inverse in this case has unique mathematical properties. We then develop a class of indefinite block preconditioners that rely on approxi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a78cb156b63ff4da519fd7fbc6b0e18a
https://doi.org/10.1137/140989996
https://doi.org/10.1137/140989996