Results 211 to 220 of about 39,793 (262)
An explicit integration approach for predicting the microstructures of multicomponent alloys. [PDF]
Nat CommunMorino T, Ode M, Hirosawa S.
europepmc +1 more source
Compact, scan-pattern-switchable 2D piezoelectric MEMS mirror with 1D addressable scanning. [PDF]
J Microelectromech SystYu J +7 more
europepmc +1 more source
Decentralized Quasi-Newton Methods [PDF]
IEEE Transactions on Signal Processing, 2017 We introduce the decentralized Broyden-Fletcher-Goldfarb-Shanno (D-BFGS) method as a variation of the BFGS quasi-Newton method for solving decentralized optimization problems. The D-BFGS method is of interest in problems that are not well conditioned, making first order decentralized methods ineffective, and in which second order information is not ...
Mark Eisen +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2021
In Chap. 6, multidimensional optimization methods were considered in which the search for the minimizer is carried out by using a set of conjugate directions. An important feature of some of these methods (e.g., the Fletcher–Reeves and Powell’s methods) is that explicit expressions for the second derivatives of \(f(\mathbf{x})\) are not required ...
Andreas Antoniou, Wu-Sheng Lu
openaire +1 more source
In Chap. 6, multidimensional optimization methods were considered in which the search for the minimizer is carried out by using a set of conjugate directions. An important feature of some of these methods (e.g., the Fletcher–Reeves and Powell’s methods) is that explicit expressions for the second derivatives of \(f(\mathbf{x})\) are not required ...
Andreas Antoniou, Wu-Sheng Lu
openaire +1 more source
2008
In this chapter we take another approach toward the development of methods lying somewhere intermediate to steepest descent and Newton’s method. Again working under the assumption that evaluation and use of the Hessian matrix is impractical or costly, the idea underlying quasi-Newton methods is to use an approximation to the inverse Hessian in place of
David G. Luenberger, Yinyu Ye
openaire +2 more sources
In this chapter we take another approach toward the development of methods lying somewhere intermediate to steepest descent and Newton’s method. Again working under the assumption that evaluation and use of the Hessian matrix is impractical or costly, the idea underlying quasi-Newton methods is to use an approximation to the inverse Hessian in place of
David G. Luenberger, Yinyu Ye
openaire +2 more sources
2011
Nel capitolo vengono descritti i metodi Quasi-Newton (noti anche come metodi tipo-secante o metodi a metrica variabile), che costituiscono una classe di metodi per la minimizzazione non vincolata basati sulla conoscenza delle derivate prime. Il piu noto dei metodi Quasi-Newton e il metodo BFGS, del quale analizziamo, nel caso convesso, le proprieta di ...
Luigi Grippo, Marco Sciandrone
openaire +1 more source
Nel capitolo vengono descritti i metodi Quasi-Newton (noti anche come metodi tipo-secante o metodi a metrica variabile), che costituiscono una classe di metodi per la minimizzazione non vincolata basati sulla conoscenza delle derivate prime. Il piu noto dei metodi Quasi-Newton e il metodo BFGS, del quale analizziamo, nel caso convesso, le proprieta di ...
Luigi Grippo, Marco Sciandrone
openaire +1 more source
1999
Dieses Kapitel behandelt die Klasse der sogenannten Quasi—Newton—Verfahren. Diese Verfahren verwenden anstelle der exakten Hesse—Matrix der zu minimierenden Funktion eine geeignete Approximation an diese (und vermeiden damit die haufig sehr aufwendige explizite Berechnung aller zweiten partiellen Ableitungen der Zielfunktion).
Carl Geiger, Christian Kanzow
openaire +1 more source
Dieses Kapitel behandelt die Klasse der sogenannten Quasi—Newton—Verfahren. Diese Verfahren verwenden anstelle der exakten Hesse—Matrix der zu minimierenden Funktion eine geeignete Approximation an diese (und vermeiden damit die haufig sehr aufwendige explizite Berechnung aller zweiten partiellen Ableitungen der Zielfunktion).
Carl Geiger, Christian Kanzow
openaire +1 more source
Quasi-Newton’s method for multiobjective optimization
Journal of Computational and Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources