Verwandte Artikel zu A Derivative-free Two Level Random Search Method for...

A Derivative-free Two Level Random Search Method for Unconstrained Optimization (SpringerBriefs in Optimization) - Softcover

 
9783030685164: A Derivative-free Two Level Random Search Method for Unconstrained Optimization (SpringerBriefs in Optimization)

Inhaltsangabe

The book is intended for graduate students and researchers in mathematics, computer science, and operational research. The book presents a new derivative-free optimization method/algorithm based on randomly generated trial points in specified domains and where the best ones are selected at each iteration by using a number of rules. This method is different from many other well established methods presented in the literature and proves to be competitive for solving many unconstrained optimization problems with different structures and complexities, with a relative large number of variables. Intensive numerical experiments with 140 unconstrained optimization problems, with up to 500 variables, have shown that this approach is efficient and robust.

Structured into 4 chapters, Chapter 1 is introductory. Chapter 2 is dedicated to presenting a two level derivative-free random search method for unconstrained optimization. It is assumed that the minimizing function is continuous, lower bounded and its minimum value is known. Chapter 3 proves the convergence of the algorithm. In Chapter 4, the numerical performances of the algorithm are shown for solving 140 unconstrained optimization problems, out of which 16 are real applications. This shows that the optimization process has two phases: the reduction phase and the stalling one. Finally, the performances of the algorithm for solving a number of 30 large-scale unconstrained optimization problems up to 500 variables are presented. These numerical results show that this approach based on the two level random search method for unconstrained optimization is able to solve a large diversity of problems with different structures and complexities.

There are a number of open problems which refer to the following aspects: the selection of the number of trial or the number of the local trial points, the selection of the bounds of the domains where the trial points and the local trial points are randomly generated and a criterion for initiating the line search.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

Neculai Andrei holds a position at the Center for Advanced Modeling and Optimization at the Academy of Romanian Scientists in Bucharest, Romania. Dr. Andrei’s areas of interest include mathematical modeling, linear programming, nonlinear optimization, high performance computing, and numerical methods in mathematical programming. In addition to this present volume, Neculai Andrei has published several books with Springer including Nonlinear Conjugate Gradient Methods for Unconstrained Optimization (2020), Continuous Nonlinear Optimization for Engineering Applications in GAMS Technology (2017), and Nonlinear Optimization Applications Using the GAMS Technology (2013).

Von der hinteren Coverseite

The book is intended for graduate students and researchers in mathematics, computer science, and operational research. The book presents a new derivative-free optimization method/algorithm based on randomly generated trial points in specified domains and where the best ones are selected at each iteration by using a number of rules. This method is different from many other well established methods presented in the literature and proves to be competitive for solving many unconstrained optimization problems with different structures and complexities, with a relative large number of variables. Intensive numerical experiments with 140 unconstrained optimization problems, with up to 500 variables, have shown that this approach is efficient and robust.

Structured into 4 chapters, Chapter 1 is introductory. Chapter 2 is dedicated to presenting a two level derivative-free random search method for unconstrained optimization. It is assumed that the minimizing function is continuous, lower bounded and its minimum value is known. Chapter 3 proves the convergence of the algorithm. In Chapter 4, the numerical performances of the algorithm are shown for solving 140 unconstrained optimization problems, out of which 16 are real applications. This shows that the optimization process has two phases: the reduction phase and the stalling one. Finally, the performances of the algorithm for solving a number of 30 large-scale unconstrained optimization problems up to 500 variables are presented. These numerical results show that this approach based on the two level random search method for unconstrained optimization is able to solve a large diversity of problems with different structures and complexities.

There are a number of open problems which refer to the following aspects: the selection of the number of trial or the number of the local trial points, the selection of the bounds of the domains where the trial points and the local trial points are randomly generated and a criterion for initiating the line search.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

  • VerlagSpringer
  • Erscheinungsdatum2021
  • ISBN 10 3030685160
  • ISBN 13 9783030685164
  • EinbandTapa blanda
  • SpracheEnglisch
  • Auflage1
  • Anzahl der Seiten132
  • Kontakt zum HerstellerNicht verfügbar

Gebraucht kaufen

Zustand: Wie neu
Most items will be dispatched the...
Diesen Artikel anzeigen

EUR 5,52 für den Versand von Vereinigtes Königreich nach Deutschland

Versandziele, Kosten & Dauer

Gratis für den Versand innerhalb von/der Deutschland

Versandziele, Kosten & Dauer

Suchergebnisse für A Derivative-free Two Level Random Search Method for...

Foto des Verkäufers

Andrei, Neculai
Verlag: Springer, 2021
ISBN 10: 3030685160 ISBN 13: 9783030685164
Gebraucht Softcover

Anbieter: WeBuyBooks, Rossendale, LANCS, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: Like New. Most items will be dispatched the same or the next working day. An apparently unread copy in perfect condition. Dust cover is intact with no nicks or tears. Spine has no signs of creasing. Pages are clean and not marred by notes or folds of any kind. Bestandsnummer des Verkäufers wbs8816500474

Verkäufer kontaktieren

Gebraucht kaufen

EUR 42,28
Währung umrechnen
Versand: EUR 5,52
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: 1 verfügbar

In den Warenkorb

Foto des Verkäufers

Neculai Andrei
ISBN 10: 3030685160 ISBN 13: 9783030685164
Neu Kartoniert / Broschiert
Print-on-Demand

Anbieter: moluna, Greven, Deutschland

Verkäuferbewertung 4 von 5 Sternen 4 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Kartoniert / Broschiert. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Clarity of presentation as well as discussion of open problems are an attractive feature for instructors and potential practitioners in derivative-free methods for optimizationHighlights a new and simple derivative-free optimization algo. Bestandsnummer des Verkäufers 458552475

Verkäufer kontaktieren

Neu kaufen

EUR 57,59
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Foto des Verkäufers

Neculai Andrei
ISBN 10: 3030685160 ISBN 13: 9783030685164
Neu Taschenbuch

Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Taschenbuch. Zustand: Neu. Neuware -The book is intended for graduate students and researchers in mathematics, computer science, and operational research. The book presents a new derivative-free optimization method/algorithm based on randomly generated trial points in specified domains and where the best ones are selected at each iteration by using a number of rules. This method is different from many other well established methods presented in the literature and proves to be competitive for solving many unconstrained optimization problems with different structures and complexities, with a relative large number of variables. Intensive numerical experiments with 140 unconstrained optimization problems, with up to 500 variables, have shown that this approach is efficient and robust.Structured into 4 chapters, Chapter 1 is introductory. Chapter 2 is dedicated to presenting a two level derivative-free random search method for unconstrained optimization. It is assumed that the minimizing function is continuous, lower bounded and its minimum value is known. Chapter 3 proves the convergence of the algorithm. In Chapter 4, the numerical performances of the algorithm are shown for solving 140 unconstrained optimization problems, out of which 16 are real applications. This shows that the optimization process has two phases: the reduction phase and the stalling one. Finally, the performances of the algorithm for solving a number of 30 large-scale unconstrained optimization problems up to 500 variables are presented. These numerical results show that this approach based on the two level random search method for unconstrained optimization is able to solve a large diversity of problems with different structures and complexities.There are a number of open problems which refer to the following aspects: the selection of the number of trial or the number of the local trial points, the selection of the bounds of the domains where the trial points and the local trial points are randomly generated and a criterion for initiating the line search.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 132 pp. Englisch. Bestandsnummer des Verkäufers 9783030685164

Verkäufer kontaktieren

Neu kaufen

EUR 64,19
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: 2 verfügbar

In den Warenkorb

Foto des Verkäufers

Neculai Andrei
ISBN 10: 3030685160 ISBN 13: 9783030685164
Neu Taschenbuch

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The book isintended for graduate students and researchers in mathematics, computer science, and operational research. The book presents a new derivative-free optimization method/algorithm based on randomly generated trial points in specified domains and where the best ones are selected at each iteration by using a number of rules. This method is different from many other well established methods presented in the literature and proves to be competitive for solving many unconstrained optimization problems with different structures and complexities, with a relative large number of variables. Intensive numerical experiments with 140 unconstrained optimization problems, with up to 500 variables, have shown that this approach is efficient and robust.Structured into 4 chapters, Chapter 1 is introductory. Chapter 2 is dedicated to presenting a two level derivative-free random search method for unconstrained optimization. It is assumed that the minimizing function is continuous, lower bounded and its minimum value is known. Chapter 3 proves the convergence of the algorithm. In Chapter 4, the numerical performances of the algorithm are shown for solving 140 unconstrained optimization problems, out of which 16 are real applications. This shows that the optimization process has two phases: thereduction phaseand thestallingone. Finally, the performances of the algorithm for solving a number of 30 large-scale unconstrained optimization problems up to 500 variables are presented. These numerical results show that this approach based on the two level random search method for unconstrained optimization is able to solve a large diversity of problems with different structures and complexities.There are a number ofopen problemswhich refer to the following aspects: the selection of the number of trial or the number of the local trial points, the selection of the bounds of the domains where the trial points and the local trial points are randomly generated and a criterion for initiating the line search. Bestandsnummer des Verkäufers 9783030685164

Verkäufer kontaktieren

Neu kaufen

EUR 64,19
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: 1 verfügbar

In den Warenkorb

Foto des Verkäufers

Neculai Andrei
ISBN 10: 3030685160 ISBN 13: 9783030685164
Neu Taschenbuch
Print-on-Demand

Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The book isintended for graduate students and researchers in mathematics, computer science, and operational research. The book presents a new derivative-free optimization method/algorithm based on randomly generated trial points in specified domains and where the best ones are selected at each iteration by using a number of rules. This method is different from many other well established methods presented in the literature and proves to be competitive for solving many unconstrained optimization problems with different structures and complexities, with a relative large number of variables. Intensive numerical experiments with 140 unconstrained optimization problems, with up to 500 variables, have shown that this approach is efficient and robust.Structured into 4 chapters, Chapter 1 is introductory. Chapter 2 is dedicated to presenting a two level derivative-free random search method for unconstrained optimization. It is assumed that the minimizing function is continuous, lower bounded and its minimum value is known. Chapter 3 proves the convergence of the algorithm. In Chapter 4, the numerical performances of the algorithm are shown for solving 140 unconstrained optimization problems, out of which 16 are real applications. This shows that the optimization process has two phases: thereduction phaseand thestallingone. Finally, the performances of the algorithm for solving a number of 30 large-scale unconstrained optimization problems up to 500 variables are presented. These numerical results show that this approach based on the two level random search method for unconstrained optimization is able to solve a large diversity of problems with different structures and complexities.There are a number ofopen problemswhich refer to the following aspects: the selection of the number of trial or the number of the local trial points, the selection of the bounds of the domains where the trial points and the local trial points are randomly generated and a criterion for initiating the line search. 132 pp. Englisch. Bestandsnummer des Verkäufers 9783030685164

Verkäufer kontaktieren

Neu kaufen

EUR 64,19
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: 2 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Andrei, Neculai
Verlag: Springer, 2021
ISBN 10: 3030685160 ISBN 13: 9783030685164
Neu Softcover

Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. In. Bestandsnummer des Verkäufers ria9783030685164_new

Verkäufer kontaktieren

Neu kaufen

EUR 75,17
Währung umrechnen
Versand: EUR 5,94
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Andrei, Neculai
Verlag: Springer, 2021
ISBN 10: 3030685160 ISBN 13: 9783030685164
Neu Softcover

Anbieter: California Books, Miami, FL, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. Bestandsnummer des Verkäufers I-9783030685164

Verkäufer kontaktieren

Neu kaufen

EUR 79,04
Währung umrechnen
Versand: EUR 8,82
Von USA nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Andrei, Neculai
Verlag: Springer, 2021
ISBN 10: 3030685160 ISBN 13: 9783030685164
Neu Softcover
Print-on-Demand

Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. PRINT ON DEMAND. Bestandsnummer des Verkäufers 18386920837

Verkäufer kontaktieren

Neu kaufen

EUR 97,69
Währung umrechnen
Versand: EUR 2,30
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: 4 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Andrei, Neculai
Verlag: Springer, 2021
ISBN 10: 3030685160 ISBN 13: 9783030685164
Neu Softcover

Anbieter: Books Puddle, New York, NY, USA

Verkäuferbewertung 4 von 5 Sternen 4 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. 1st ed. 2021 edition NO-PA16APR2015-KAP. Bestandsnummer des Verkäufers 26386920847

Verkäufer kontaktieren

Neu kaufen

EUR 92,67
Währung umrechnen
Versand: EUR 7,94
Von USA nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: 4 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Andrei, Neculai
Verlag: Springer Nature, 2021
ISBN 10: 3030685160 ISBN 13: 9783030685164
Neu Paperback

Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Paperback. Zustand: Brand New. 132 pages. 9.25x6.10x0.43 inches. In Stock. Bestandsnummer des Verkäufers x-3030685160

Verkäufer kontaktieren

Neu kaufen

EUR 91,58
Währung umrechnen
Versand: EUR 11,92
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: 2 verfügbar

In den Warenkorb

Es gibt 3 weitere Exemplare dieses Buches

Alle Suchergebnisse ansehen