Minimization In Convex Sets
Mostrando 1-2 de 2 artigos, teses e dissertações.
-
1. Comparative study of spectral steplengths and nonmonotone linear searches / Estudo comparativo de passos espectrais e buscas lineares não monótonas
The Spectral Gradient method, introduced by Barzilai and Borwein and analized by Raydan for unconstrained minimization, is a simple method whose performance is comparable to traditional methods, such as conjugate gradients. Since the introduction of method, as well as its extension to minimization of convex sets, there were introduced various combinations of
Publicado em: 2008
-
2. On the convergence properties of the projected gradient method for convex optimization
When applied to an unconstrained minimization problem with a convex objective, the steepest descent method has stronger convergence properties than in the noncovex case: the whole sequence converges to an optimal solution under the only hypothesis of existence of minimizers (i.e. without assuming e.g. boundedness of the level sets). In this paper we look at
Computational & Applied Mathematics. Publicado em: 2003