Relevant bibliographies by topics / Quasi-newton search

Academic literature on the topic 'Quasi-newton search'

Author: Grafiati
Published: 4 June 2021
Last updated: 19 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Quasi-newton search.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Quasi-newton search"

1

Bao, Wang, and Wang Yanxin. "Sub-Direction Parallel Search Quasi-Newton Algorithm." International Journal of Modeling and Optimization 8, no. 3 (June 2018): 131–37. http://dx.doi.org/10.7763/ijmo.2018.v8.637.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wills, Adrian G., and Thomas B. Schön. "Stochastic quasi-Newton with line-search regularisation." Automatica 127 (May 2021): 109503. http://dx.doi.org/10.1016/j.automatica.2021.109503.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hassan, Basim Abbas, Kanikar Muangchoo, Fadhil Alfarag, Abdulkarim Hassan Ibrahim, and Auwal Bala Abubakar. "An improved quasi-Newton equation on the quasi-Newton methods for unconstrained optimizations." Indonesian Journal of Electrical Engineering and Computer Science 22, no. 2 (May 1, 2021): 997. http://dx.doi.org/10.11591/ijeecs.v22.i2.pp997-1005.

Full text
Abstract:
<span><span>Quasi-Newton methods are a class of numerical methods for </span>solving the problem of unconstrained optimization. To improve the overall efficiency of resulting algorithms, we use the quasi-Newton methods which is interesting for quasi-Newton equation. In this manuscript, we present a modified BFGS update formula based on the new quasi-Newton equation, which give a new search direction for solving unconstrained optimizations proplems. We analyse the convergence rate of quasi-Newton method under some mild condition. Numerical experiments are conducted to demonstrate the efficiency of new methods using some test problems. The results indicates that the proposed method is competitive compared to the BFGS methods as it yielded fewer iteration and fewer function evaluations.</span>
APA, Harvard, Vancouver, ISO, and other styles
4

Price, Christopher John. "A direct search quasi-Newton method for nonsmooth unconstrained optimization." ANZIAM Journal 59 (January 3, 2018): 215. http://dx.doi.org/10.21914/anziamj.v59i0.10651.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

PRICE, C. J. "A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION." ANZIAM Journal 59, no. 2 (October 2017): 215–31. http://dx.doi.org/10.1017/s1446181117000323.

Full text
Abstract:
A direct search quasi-Newton algorithm is presented for local minimization of Lipschitz continuous black-box functions. The method estimates the gradient via central differences using a maximal frame around each iterate. When nonsmoothness prevents progress, a global direction search is used to locate a descent direction. Almost sure convergence to Clarke stationary point(s) is shown, where convergence is independent of the accuracy of the gradient estimates. Numerical results show that the method is effective in practice.
APA, Harvard, Vancouver, ISO, and other styles
6

Shi, Zhen-Jun. "Convergence of quasi-Newton method with new inexact line search." Journal of Mathematical Analysis and Applications 315, no. 1 (March 2006): 120–31. http://dx.doi.org/10.1016/j.jmaa.2005.05.077.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wu, Ting, and Linping Sun. "A quasi-Newton based pattern search algorithm for unconstrained optimization." Applied Mathematics and Computation 183, no. 1 (December 2006): 685–94. http://dx.doi.org/10.1016/j.amc.2006.05.107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Moghrabi, Issam A. R. "Extra multistep BFGS updates in quasi-Newton methods." International Journal of Mathematics and Mathematical Sciences 2006 (2006): 1–8. http://dx.doi.org/10.1155/ijmms/2006/12583.

Full text
Abstract:
This note focuses on developing quasi-Newton methods that combinem+1multistep and single-step updates on a single iteration for the sake of constructing the new approximation to the Hessian matrix to be used on the next iteration in computing the search direction. The approach considered here exploits the merits of the multistep methods and those of El-Baali (1999) to create a hybrid technique. Our numerical results are encouraging and reveal that our proposed approach is promising. The new methods compete well with El-Baali's extra update algorithms (1999).
APA, Harvard, Vancouver, ISO, and other styles
9

Beigi, H. S. M., and C. J. Li. "Learning Algorithms for Neural Networks Based on Quasi-Newton Methods With Self-Scaling." Journal of Dynamic Systems, Measurement, and Control 115, no. 1 (March 1, 1993): 38–43. http://dx.doi.org/10.1115/1.2897405.

Full text
Abstract:
Previous studies have suggested that, for moderate sized neural networks, the use of classical Quasi-Newton methods yields the best convergence properties among all the state-of-the-art [1]. This paper describes a set of even better learning algorithms based on a class of Quasi-Newton optimization techniques called Self-Scaling Variable Metric (SSVM) methods. One of the characteristics of SSVM methods is that they provide a set of search directions which are invariant under the scaling of the objective function. With an XOR benchmark and an encoder benchmark, simulations using the SSVM algorithms for the learning of general feedforward neural networks were carried out to study their performance. Compared to classical Quasi-Newton methods, it is shown that the SSVM method reduces the number of iterations required for convergence by 40 percent to 60 percent that of the classical Quasi-Newton methods which, in general, converge two to three orders of magnitude faster than the steepest descent techniques.
APA, Harvard, Vancouver, ISO, and other styles
10

Pošík, Petr, and Waltraud Huyer. "Restarted Local Search Algorithms for Continuous Black Box Optimization." Evolutionary Computation 20, no. 4 (December 2012): 575–607. http://dx.doi.org/10.1162/evco_a_00087.

Full text
Abstract:
Several local search algorithms for real-valued domains (axis parallel line search, Nelder-Mead simplex search, Rosenbrock's algorithm, quasi-Newton method, NEWUOA, and VXQR) are described and thoroughly compared in this article, embedding them in a multi-start method. Their comparison aims (1) to help the researchers from the evolutionary community to choose the right opponent for their algorithm (to choose an opponent that would constitute a hard-to-beat baseline algorithm), (2) to describe individual features of these algorithms and show how they influence the algorithm on different problems, and (3) to provide inspiration for the hybridization of evolutionary algorithms with these local optimizers. The recently proposed Comparing Continuous Optimizers (COCO) methodology was adopted as the basis for the comparison. The results show that in low dimensional spaces, the old method of Nelder and Mead is still the most successful among those compared, while in spaces of higher dimensions, it is better to choose an algorithm based on quadratic modeling, such as NEWUOA or a quasi-Newton method.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Quasi-newton search"

1

Stepanenko, Svetlana. "Global Optimization Methods based on Tabu Search." Doctoral thesis, kostenfrei, 2008. http://www.opus-bayern.de/uni-wuerzburg/volltexte/2008/3060/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Clausner, André. "Anwendung von Line-Search-Strategien zur Formoptimierung und Parameteridentifikation." Master's thesis, Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-114858.

Full text
Abstract:
Die kontinuierliche Weiterentwicklung und Verbesserung technischer Prozesse erfolgt heute auf der Basis stochastischer und deterministischer Optimierungsstrategien in Kombination mit der numerischen Simulation dieser Abläufe. Da die FE-Simulation von Umformvorgängen in der Regel sehr zeitintensiv ist, bietet sich für die Optimierung solcher Prozesse der Einsatz deterministischer Methoden an, da hier weniger Optimierungsschritte und somit auch weniger FE-Simulationen notwendig sind. Eine wichtige Anforderung an solche Optimierungsverfahren ist globale Konvergenz zu lokalen Minima, da die optimalen Parametersätze nicht immer näherungsweise bekannt sind. Die zwei wichtigsten Strategien zum Ausdehnen des beschränkten Konvergenzradius der natürlichen Optimierungsverfahren (newtonschrittbasierte Verfahren und Gradientenverfahren) sind die Line-Search-Strategie und die Trust-Region-Strategie. Die Grundlagen der Line-Search-Strategie werden aufgearbeitet und die wichtigsten Teilalgorithmen implementiert. Danach wird dieses Verfahren auf eine effiziente Kombination der Teilalgorithmen und Verfahrensparameter hin untersucht. Im Anschluss wird die Leistung eines Optimierungsverfahrens mit Line-Search-Strategie verglichen mit der eines ebenfalls implementierten Optimierungsverfahrens mit skalierter Trust-Region-Strategie. Die Tests werden nach Einfügen der implementierten Verfahren in das Programm SPC-Opt anhand der Lösung eines Quadratmittelproblems aus der Materialparameteridentifikation sowie der Formoptimierung eines Umformwerkzeugs vorgenommen.
APA, Harvard, Vancouver, ISO, and other styles
3

Jacmenovic, Dennis, and dennis_jacman@yahoo com au. "Optimisation of Active Microstrip Patch Antennas." RMIT University. Electrical and Computer Engineering, 2004. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20060307.144507.

Full text
Abstract:
This thesis presents a study of impedance optimisation of active microstrip patch antennas to multiple frequency points. A single layered aperture coupled microstrip patch antenna has been optimised to match the source reflection coefficient of a transistor in designing an active antenna. The active aperture coupled microstrip patch antenna was optimised to satisfy Global Positioning System (GPS) frequency specifications. A rudimentary aperture coupled microstrip patch antenna consists of a rectangular antenna element etched on the top surface of two dielectric substrates. The substrates are separated by a ground plane and a microstrip feed is etched on the bottom surface. A rectangular aperture in the ground plane provides coupling between the feed and the antenna element. This type of antenna, which conveniently isolates any circuit at the feed from the antenna element, is suitable for integrated circuit design and is simple to fabricate. An active antenna design directly couples an antenna to an active device, therefore saving real estate and power. This thesis focuses on designing an aperture coupled patch antenna directly coupled to a low noise amplifier as part of the front end of a GPS receiver. In this work an in-house software package, dubbed ACP by its creator Dr Rod Waterhouse, for calculating aperture coupled microstrip patch antenna performance parameters was linked to HP-EEsof, a microwave computer aided design and simulation package by Hewlett-Packard. An ANSI C module in HP-EEsof was written to bind the two packages. This process affords the client the benefit of powerful analysis tools offered in HP-EEsof and the fast analysis of ACP for seamless system design. Moreover, the optimisation algorithms in HP-EEsof were employed to investigate which algorithms are best suited for optimising patch antennas. The active antenna design presented in this study evades an input matching network, which is accomplished by designing the antenna to represent the desired source termination of a transistor. It has been demonstrated that a dual-band microstrip patch antenna can be successfully designed to match the source reflection coefficient, avoiding the need to insert a matching network. Maximum power transfer in electrical circuits is accomplished by matching the impedance between entities, which is generally acheived with the use of a matching network. Passive matching networks employed in amplifier design generally consist of discrete components up to the low GHz frequency range or distributed elements at greater frequencies. The source termination for a low noise amplifier will greatly influence its noise, gain and linearity which is controlled by designing a suitable input matching network. Ten diverse search methods offered in HP-EEsof were used to optimise an active aperture coupled microstrip patch antenna. This study has shown that the algorithms based on the randomised search techniques and the Genetic algorithm provide the most robust performance. The optimisation results were used to design an active dual-band antenna.
APA, Harvard, Vancouver, ISO, and other styles
4

Clausner, André. "Anwendung von Line-Search-Strategien zur Formoptimierung und Parameteridentifikation." Master's thesis, 2007. https://monarch.qucosa.de/id/qucosa%3A19910.

Full text
Abstract:
Die kontinuierliche Weiterentwicklung und Verbesserung technischer Prozesse erfolgt heute auf der Basis stochastischer und deterministischer Optimierungsstrategien in Kombination mit der numerischen Simulation dieser Abläufe. Da die FE-Simulation von Umformvorgängen in der Regel sehr zeitintensiv ist, bietet sich für die Optimierung solcher Prozesse der Einsatz deterministischer Methoden an, da hier weniger Optimierungsschritte und somit auch weniger FE-Simulationen notwendig sind. Eine wichtige Anforderung an solche Optimierungsverfahren ist globale Konvergenz zu lokalen Minima, da die optimalen Parametersätze nicht immer näherungsweise bekannt sind. Die zwei wichtigsten Strategien zum Ausdehnen des beschränkten Konvergenzradius der natürlichen Optimierungsverfahren (newtonschrittbasierte Verfahren und Gradientenverfahren) sind die Line-Search-Strategie und die Trust-Region-Strategie. Die Grundlagen der Line-Search-Strategie werden aufgearbeitet und die wichtigsten Teilalgorithmen implementiert. Danach wird dieses Verfahren auf eine effiziente Kombination der Teilalgorithmen und Verfahrensparameter hin untersucht. Im Anschluss wird die Leistung eines Optimierungsverfahrens mit Line-Search-Strategie verglichen mit der eines ebenfalls implementierten Optimierungsverfahrens mit skalierter Trust-Region-Strategie. Die Tests werden nach Einfügen der implementierten Verfahren in das Programm SPC-Opt anhand der Lösung eines Quadratmittelproblems aus der Materialparameteridentifikation sowie der Formoptimierung eines Umformwerkzeugs vorgenommen.:1 Einleitung 7 2 Verfahren zur unrestringierten Optimierung 9 2.1 Vorbemerkungen 9 2.2 Der Schrittvektor sk 10 2.3 Natürliche Schrittweite und Konvergenz der Verfahren 11 2.4 Richtung des steilsten Abstiegs 12 2.5 Newtonschrittbasierte Verfahren 13 2.5.1 Newton-Verfahren 15 2.5.2 Quasi-Newton-Verfahren der Broyden-Klasse 15 2.5.3 Der BFGS-Auffrisch-Algorithmus 18 2.5.4 Die SR1-Auffrisch-Formel 19 2.5.5 Die DFP-Auffrisch-Formel 20 2.5.6 Gauß-Newton-Verfahren 20 2.6 Erzwingen der Bedingung der positiven Definitheit von Gk 21 3 Übersicht über die Verfahren zum Stabilisieren der natürlichen Schrittweiten 24 3.1 Das Prinzip der Line-Search-Verfahren 24 3.2 Das Prinzip der Trust-Region-Verfahren 26 3.3 Vergleich der Trust-Region- und der Line-Search-Strategien 27 4 Line-Search-Strategien 30 4.1 Vorbemerkungen 30 4.2 Ein prinzipieller Line-Search-Algorithmus 33 5 Die Akzeptanzkriterien für die Line-Search-Strategien 36 5.1 Die exakte Schrittweite 37 5.2 Das Armijo-Kriterium, ein Abstiegskriterium 39 5.2.1 Das klassische Armijo-Kriterium 39 5.2.2 Armijo-Kriterium mit unterer Schranke fflo > 0 40 5.3 Die Goldstein-Kriterien 42 5.4 Die Wolfe-Kriterien 44 5.4.1 Die einfachen Wolfe-Kriterien 44 5.4.2 Die starken Wolfe-Kriterien 46 5.5 Näherungsweiser Line-Search basierend auf Armijo, ff-Methode 47 6 Ermittlung der nächsten Testschrittweite ffj+1 49 6.1 Die Startschrittweite ffj=1 51 6.2 Verfahren mit konstanten Faktoren 52 6.3 Verfahren mit konstanten Summanden 53 6.4 Verfahren mit quadratischen Polynomen 54 6.5 Verfahren mit kubischen Polynomen 56 6.6 Sektionssuche mit goldenem Schnitt 58 7 Absicherung und Abbruchbedingungen des Line-Search-Verfahrens 60 7.1 Die drei Konvergenzpunkte eines Line-Search-Verfahrens 60 7.1.1 Lokales Minimum in f 60 7.1.2 Algorithmus konvergiert gegen −1 61 7.1.3 Der Winkel zwischen sk und −rfk wird 90° 61 7.2 Weitere Absicherungen 62 7.2.1 Abstiegsrichtung 62 7.2.2 Der gradientenbezogene Schrittvektor 62 7.2.3 Zulässige Schrittweiten in der Extrapolationsphase 63 7.2.4 Intervalle bei der Interpolation 63 7.2.5 Maximale Durchlaufzahlen 63 8 Implementierung 65 8.1 Grundlegende Struktur der Implementierung 65 8.2 Anwendungsgebiete 67 8.2.1 Identifikation der Materialparameter der isotropen Verfestigung und der HILLschen Fließbedingung 67 8.2.2 Optimierung der Form eines Umformwerkzeugs 70 8.3 Test des Programms anhand der Identifikation der Parameter der isotropen Verfestigung und der HILLschen Fließbedingung 71 8.3.1 Einfluss der Funktionsumgebung 71 8.3.2 Test der Line-Search-Verfahrensparameter 74 8.3.3 Einfluss der Startwerte und der Qualität der Ableitungsermittlung 77 8.3.4 Test der Quasi-Newton-Strategien 77 8.3.5 Test der Trust-Region-Skalierung 79 8.3.6 Vergleich der Trust-Region- und der Line-Search-Strategie 80 8.3.7 Tests mit den HILLschen Anisotropieparametern und drei Vorwärtsrechnungen 81 9 Zusammenfassung und Ausblick 83 9.1 Zusammenfassung 83 9.2 Ausblick 84 Liste häufig verwendeter Formelzeichen 85 Literaturverzeichnis 88 A Zusätzliches zur Implementierung 90 A.1 Parametervorschläge für die Line-Search-Verfahren 90 A.2 Fehlercode-Liste 92 A.3 Programmablaufpläne 94 A.3.1 Ablauf in main.cpp 94 A.3.2 Ablauf in OneOptLoop 95 A.3.3 Ablauf während des Trust-Region-Verfahrens 96 A.3.4 Ablauf während des Line-Search-Verfahrens 97 A.4 Steuerung der Optimierungsoptionen über OptInputData.dat 98 A.4.1 Übergeordnete Algorithmen 98 A.4.1.1 Quasi-Newton-Verfahren 98 A.4.1.2 Absichern der positiven Definitheit von Gk 99 A.4.1.3 Auswahl des Optimierungsverfahrens, Auswahl der Schrittweitensteuerung 100 A.4.1.4 Abbruchbedingungen für die Lösungsfindung 100 A.4.1.5 Wahl des Startvektors x0 101 A.4.2 Die Trust-Region-Algorithmen 102 A.4.2.1 Wahl des Anfangsradius 0 des Vertrauensbereichs 102 A.4.2.2 Wahl des Skalierungsverfahrens 102 A.4.2.3 Wahl des Startwertes l=0 für die Regularisierungsparameteriteration 103 A.4.2.4 Regularisierungsparameteriteration 103 A.4.2.5 Wahl des Verfahrens zum Auffrischen des Radius des Vertrauensbereichs 103 A.4.2.6 Bedingungen für einen akzeptablen Schritt 104 A.4.2.7 Absicherungen des Trust-Region-Verfahrens 104 A.4.3 Die Line-Search-Algorithmen 105 A.4.3.1 Die Akzeptanzkriterien 105 A.4.3.2 Die Verfahren zur Extrapolation 105 A.4.3.3 Die Verfahren zur Interpolation 106 A.4.3.4 Verfahren zur Wahl von ffj=2 106 A.4.3.5 Absicherung des Line-Search-Verfahrens 106 B Testrechnungen 107 B.1 Ausgewählte Versuchsreihen 107 B.2 Bilder der Funktionsumgebung der Materialparameteridentifikation 109 B.3 Beschreibung der digitalen Anlagen 112 Eidesstattliche Erklärung und Aufgabenstellung 113
APA, Harvard, Vancouver, ISO, and other styles
5

Αποστολοπούλου, Μαριάννα. "Μαθηματικές μέθοδοι βελτιστοποίησης προβλημάτων μεγάλης κλίμακας." Thesis, 2011. http://hdl.handle.net/10889/5699.

Full text
Abstract:
Στην παρούσα διατριβή μελετάμε το πρόβλημα της βελτιστοποίησης μη γραμμικών συναρτήσεων πολλών μεταβλητών, όπου η αντικειμενική συνάρτηση είναι συνεχώς διαφορίσιμη σε ένα ανοιχτό υποσύνολο του Rn. Αναπτύσσουμε μαθηματικές μεθόδους βελτιστοποίησης αποσκοπώντας στην επίλυση προβλημάτων μεγάλης κλίμακας, δηλαδή προβλημάτων των οποίων οι μεταβλητές είναι πολλές χιλιάδες, ακόμα και εκατομμύρια. Η βασική ιδέα των μεθόδων που αναπτύσσουμε έγκειται στη θεωρητική μελέτη των χαρακτηριστικών μεγεθών των Quasi-Newton ενημερώσεων ελάχιστης και μικρής μνήμης. Διατυπώνουμε θεωρήματα αναφορικά με το χαρακτηριστικό πολυώνυμο, τον αριθμό των διακριτών ιδιοτιμών και των αντίστοιχων ιδιοδιανυσμάτων. Εξάγουμε κλειστούς τύπους για τον υπολογισμό των ανωτέρω ποσοτήτων, αποφεύγοντας τόσο την αποθήκευση όσο και την παραγοντοποίηση πινάκων. Τα νέα θεωρητικά απoτελέσματα εφαρμόζονται αφενός μεν στην επίλυση μεγάλης κλίμακας υποπροβλημάτων περιοχής εμπιστοσύνης, χρησιμοποιώντας τη μέθοδο της σχεδόν ακριβούς λύσης, αφετέρου δε, στην καμπυλόγραμμη αναζήτηση, η οποία χρησιμοποιεί ένα ζεύγος κατευθύνσεων μείωσης, την Quasi-Newton κατεύθυνση και την κατεύθυνση αρνητικής καμπυλότητας. Η νέα μέθοδος μειώνει δραστικά τη χωρική πολυπλοκότητα των γνωστών αλγορίθμων του μη γραμμικού προγραμματισμού, διατηρώντας παράλληλα τις καλές ιδιότητες σύγκλισής τους. Ως αποτέλεσμα, οι προκύπτοντες νέοι αλγόριθμοι έχουν χωρική πολυπλοκότητα Θ(n). Τα αριθμητικά αποτελέσματα δείχνουν ότι οι νέοι αλγόριθμοι είναι αποδοτικοί, γρήγοροι και πολύ αποτελεσματικοί όταν χρησιμοποιούνται στην επίλυση προβλημάτων με πολλές μεταβλητές.
In this thesis we study the problem of minimizing nonlinear functions of several variables, where the objective function is continuously differentiable on an open subset of Rn. We develop mathematical optimization methods for solving large scale problems, i.e., problems whose variables are many thousands, even millions. The proposed method is based on the theoretical study of the properties of minimal and low memory Quasi-Newton updates. We establish theorems concerning the characteristic polynomial, the number of distinct eigenvalues and corresponding eigenvectors. We derive closed formulas for calculating these quantities, avoiding both the storage and factorization of matrices. The new theoretical results are applied in the large scale trust region subproblem for calculating nearly exact solutions as well as in a curvilinear search that uses a Quasi-Newton and a negative curvature direction. The new method is drastically reducing the spatial complexity of known algorithms of nonlinear programming. As a result, the new algorithms have spatial complexity Θ(n), while they are maintaining good convergence properties. The numerical results show that the proposed algorithms are efficient, fast and very effective when used in solving large scale problems.
APA, Harvard, Vancouver, ISO, and other styles
6

楊泄煌. "Solution of non-liear programming:comparison of different line searches under quasi-newton method." Thesis, 1989. http://ndltd.ncl.edu.tw/handle/73368430750170127781.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Quasi-newton search"

1

Gilbert, Jean Charles. "Piecewise Line-search Techniques for Constrained Minimization by Quasi-newton Algorithms." In Applied Optimization, 73–103. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4613-3335-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Anile, A. M., V. Cutello, G. Narzisi, G. Nicosia, and S. Spinella. "Lipschitzian Pattern Search and Immunological Algorithm with Quasi-Newton Method for the Protein Folding Problem: An Innovative Multistage Approach." In Neural Nets, 307–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11731177_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Quasi-newton search"

1

Sofi, A. Z. M., M. Mamat, I. Mohd, and M. A. H. Ibrahim. "Conjugate gradient and steepest descent approach on quasi-Newton search direction." In PROCEEDINGS OF THE 21ST NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES (SKSM21): Germination of Mathematical Sciences Education and Research towards Global Sustainability. AIP Publishing LLC, 2014. http://dx.doi.org/10.1063/1.4887759.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

dos Santos Coelho, Leandro, and Viviana Cocco Mariani. "Particle Swarm Optimization with Quasi-Newton Local Search for Solving Economic Dispatch Problem." In 2006 IEEE International Conference on Systems, Man and Cybernetics. IEEE, 2006. http://dx.doi.org/10.1109/icsmc.2006.384593.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Satoshi Ono, Yusuke Hirotani, and Shigeru Nakayama. "Multiple solution search based on hybridization of real-coded evolutionary algorithm and quasi-newton method." In 2007 IEEE Congress on Evolutionary Computation. IEEE, 2007. http://dx.doi.org/10.1109/cec.2007.4424597.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nokleby, Scott B., and Ron P. Podhorodeski. "Optimization-Based Synthesis of Grashof Geared Five-Bar Mechanisms." In ASME 2000 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2000. http://dx.doi.org/10.1115/detc2000/mech-14176.

Full text
Abstract:
Abstract A quasi-Newton optimization routine and Grashof criteria for geared five-bar mechanisms are used to develop a Grashof five-bar mechanism synthesis routine. The synthesis routine uses a sequential transformation set that maps from an unconstrained search variable space to a constrained design variable space. The transformation set ensures that Grashof criteria are satisfied and that all mechanism parameters satisfy specified upper and lower constraints. Example results demonstrate the effectiveness of the quasi-Newton optimization technique, along with appropriate parameter transformations and geared five-bar Grashof criteria, for the synthesis of Grashof five-bar mechanisms.
APA, Harvard, Vancouver, ISO, and other styles
5

Alpak, Faruk, Yixuan Wang, Guohua Gao, and Vivek Jain. "Benchmarking and Field-Testing of the Distributed Quasi-Newton Derivative-Free Optimization Method for Field Development Optimization." In SPE Annual Technical Conference and Exhibition. SPE, 2021. http://dx.doi.org/10.2118/206267-ms.

Full text
Abstract:
Abstract Recently, a novel distributed quasi-Newton (DQN) derivative-free optimization (DFO) method was developed for generic reservoir performance optimization problems including well-location optimization (WLO) and well-control optimization (WCO). DQN is designed to effectively locate multiple local optima of highly nonlinear optimization problems. However, its performance has neither been validated by realistic applications nor compared to other DFO methods. We have integrated DQN into a versatile field-development optimization platform designed specifically for iterative workflows enabled through distributed-parallel flow simulations. DQN is benchmarked against alternative DFO techniques, namely, the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method hybridized with Direct Pattern Search (BFGS-DPS), Mesh Adaptive Direct Search (MADS), Particle Swarm Optimization (PSO), and Genetic Algorithm (GA). DQN is a multi-thread optimization method that distributes an ensemble of optimization tasks among multiple high-performance-computing nodes. Thus, it can locate multiple optima of the objective function in parallel within a single run. Simulation results computed from one DQN optimization thread are shared with others by updating a unified set of training data points composed of responses (implicit variables) of all successful simulation jobs. The sensitivity matrix at the current best solution of each optimization thread is approximated by a linear-interpolation technique using all or a subset of training-data points. The gradient of the objective function is analytically computed using the estimated sensitivities of implicit variables with respect to explicit variables. The Hessian matrix is then updated using the quasi-Newton method. A new search point for each thread is solved from a trust-region subproblem for the next iteration. In contrast, other DFO methods rely on a single-thread optimization paradigm that can only locate a single optimum. To locate multiple optima, one must repeat the same optimization process multiple times starting from different initial guesses for such methods. Moreover, simulation results generated from a single-thread optimization task cannot be shared with other tasks. Benchmarking results are presented for synthetic yet challenging WLO and WCO problems. Finally, DQN method is field-tested on two realistic applications. DQN identifies the global optimum with the least number of simulations and the shortest run time on a synthetic problem with known solution. On other benchmarking problems without a known solution, DQN identified compatible local optima with reasonably smaller numbers of simulations compared to alternative techniques. Field-testing results reinforce the auspicious computational attributes of DQN. Overall, the results indicate that DQN is a novel and effective parallel algorithm for field-scale development optimization problems.
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Jia, and Qiang Liu. "Speed and Resource Optimization of BFGS Quasi-Newton Implementation on FPGA Using Inexact Line Search Method for Neural Network Training." In 2018 International Conference on Field-Programmable Technology (FPT). IEEE, 2018. http://dx.doi.org/10.1109/fpt.2018.00074.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Simeunovic´, G. V., P. Zi´tek, T. Vyhli´dal, and D. Lj Debeljkovic´. "Separate Parameters Identification of the Miso Time Delay Model Applied to the Heat Transfer Process." In ASME 2011 International Mechanical Engineering Congress and Exposition. ASMEDC, 2011. http://dx.doi.org/10.1115/imece2011-63831.

Full text
Abstract:
The paper presents the identification issues and the parameters identification algorithm that separates the system parameters from the time delays for a class of multi-input single-output (MISO) linear time delay systems (LTDS). The presence of the unknown time delay greatly complicates the parameter estimation problem, because the parameters of the model are not linear with respect to the time-delay in terms of the identification. This problem for SISO systems is solved in the papers [6] and [7]. Solution presented in the previous mentioned paper is based on the nonlinear least square problem developed in the paper [1]. In this paper, the approach worked out in the papers [6] and [7] is extended to the class of MISO systems. The multipoint search method based on the Quasi-Newton technique is used for the minimization of variable projection functional. The special Quasi-Newton algorithm, which involves the several initial conditions treated at the same time, developed in [5], is applied here. This approach is illustrated by a particular application in the field of the heat transfer, on the time-delay model of the heat exchanger in the laboratory environment.
APA, Harvard, Vancouver, ISO, and other styles
8

Pettersson, Marcus, and Johan O¨lvander. "Adaptive Complex Method for Efficient Design Optimization." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34773.

Full text
Abstract:
Box’s Complex method for direct search has shown promise when applied to simulation based optimization. In direct search methods, like Box’s Complex method, the search starts with a set of points, where each point is a solution to the optimization problem. In the Complex method the number of points must be at least one plus the number of variables. However, in order to avoid premature termination and increase the likelihood of finding the global optimum more points are often used at the expense of the required number of evaluations. The idea in this paper is to gradually remove points during the optimization in order to achieve an adaptive Complex method for more efficient design optimization. The proposed method shows encouraging results when compared to the Complex method with fix number of points and a quasi-Newton method.
APA, Harvard, Vancouver, ISO, and other styles
9

Xu, Yanwen, and Pingfeng Wang. "A Comparison of Numerical Optimizers in Developing High Dimensional Surrogate Models." In ASME 2019 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/detc2019-97499.

Full text
Abstract:
Abstract The Gaussian Process (GP) model has become one of the most popular methods to develop computationally efficient surrogate models in many engineering design applications, including simulation-based design optimization and uncertainty analysis. When more observations are used for high dimensional problems, estimating the best model parameters of Gaussian Process model is still an essential yet challenging task due to considerable computation cost. One of the most commonly used methods to estimate model parameters is Maximum Likelihood Estimation (MLE). A common bottleneck arising in MLE is computing a log determinant and inverse over a large positive definite matrix. In this paper, a comparison of five commonly used gradient based and non-gradient based optimizers including Sequential Quadratic Programming (SQP), Quasi-Newton method, Interior Point method, Trust Region method and Pattern Line Search for likelihood function optimization of high dimension GP surrogate modeling problem is conducted. The comparison has been focused on the accuracy of estimation, the efficiency of computation and robustness of the method for different types of Kernel functions.
APA, Harvard, Vancouver, ISO, and other styles
10

Saxena, A., X. Wang, and G. K. Ananthasuresh. "PennSyn: A Topology Synthesis Software for Compliant Mechanisms." In ASME 2000 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2000. http://dx.doi.org/10.1115/detc2000/mech-14139.

Full text
Abstract:
Abstract In this paper, we present PennSyn, a software with graphical user interface that provides an automated design route from function specifications to fabrication of fully compliant mechanisms. PennSyn uses the notion of maximizing the flexibility and stiffness of a continuum simultaneously through multi-criteria objectives for the topology synthesis of compliant mechanisms. Both the optimality criteria and quasi Newton mathematical programming methods are employed as optimization algorithms in PennSyn. Reliability in the optimality criteria method is ensured using a one variable search while the volume constraint is addressed by global resizing of variables without altering the function value locally. The design continuum is represented using ground structures of linear truss and frame finite elements. These element types are easy and robust in implementation and help provide effortless extraction and transfer of optimal topologies into commercial CAD packages. An edge detection algorithm is used with PennSyn for boundary extraction of optimal compliant geometries. The resulting data is stored in IGES format for easy portability into commercial modeling and analysis software packages.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Quasi-newton search' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography