Articles liés à A Derivative-free Two Level Random Search Method for...

A Derivative-free Two Level Random Search Method for Unconstrained Optimization - Couverture souple

 
9783030685164: A Derivative-free Two Level Random Search Method for Unconstrained Optimization

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

À propos de l?auteur

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).

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

  • ÉditeurSpringer
  • Date d'édition2021
  • ISBN 10 3030685160
  • ISBN 13 9783030685164
  • ReliureBroché
  • Langueanglais
  • Numéro d'édition1
  • Nombre de pages132
  • Coordonnées du fabricantnon disponible

Acheter D'occasion

état :  Comme neuf
Most items will be dispatched the...
Afficher cet article
EUR 42,07

Autre devise

EUR 5,49 expédition depuis Royaume-Uni vers France

Destinations, frais et délais

Acheter neuf

Afficher cet article
EUR 57,59

Autre devise

EUR 9,70 expédition depuis Allemagne vers France

Destinations, frais et délais

Résultats de recherche pour A Derivative-free Two Level Random Search Method for...

Image fournie par le vendeur

Andrei, Neculai
Edité par Springer, 2021
ISBN 10 : 3030685160 ISBN 13 : 9783030685164
Ancien ou d'occasion Couverture souple

Vendeur : WeBuyBooks, Rossendale, LANCS, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : 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. N° de réf. du vendeur wbs8816500474

Contacter le vendeur

Acheter D'occasion

EUR 42,07
Autre devise
Frais de port : EUR 5,49
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Neculai Andrei
ISBN 10 : 3030685160 ISBN 13 : 9783030685164
Neuf Kartoniert / Broschiert
impression à la demande

Vendeur : moluna, Greven, Allemagne

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

Kartoniert / Broschiert. Etat : 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. N° de réf. du vendeur 458552475

Contacter le vendeur

Acheter neuf

EUR 57,59
Autre devise
Frais de port : EUR 9,70
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

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

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : 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. N° de réf. du vendeur 9783030685164

Contacter le vendeur

Acheter neuf

EUR 64,19
Autre devise
Frais de port : EUR 10,99
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Neculai Andrei
ISBN 10 : 3030685160 ISBN 13 : 9783030685164
Neuf Taschenbuch
impression à la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : 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. N° de réf. du vendeur 9783030685164

Contacter le vendeur

Acheter neuf

EUR 64,19
Autre devise
Frais de port : EUR 11
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

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

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : 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. N° de réf. du vendeur 9783030685164

Contacter le vendeur

Acheter neuf

EUR 64,19
Autre devise
Frais de port : EUR 15
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Andrei, Neculai
Edité par Springer, 2021
ISBN 10 : 3030685160 ISBN 13 : 9783030685164
Neuf Couverture souple

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. In. N° de réf. du vendeur ria9783030685164_new

Contacter le vendeur

Acheter neuf

EUR 74,79
Autre devise
Frais de port : EUR 4,73
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Andrei, Neculai
Edité par Springer, 2021
ISBN 10 : 3030685160 ISBN 13 : 9783030685164
Neuf Couverture souple

Vendeur : California Books, Miami, FL, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur I-9783030685164

Contacter le vendeur

Acheter neuf

EUR 78,96
Autre devise
Frais de port : EUR 7,05
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Andrei, Neculai
Edité par Springer, 2021
ISBN 10 : 3030685160 ISBN 13 : 9783030685164
Neuf Couverture souple

Vendeur : Books Puddle, New York, NY, Etats-Unis

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. 1st ed. 2021 edition NO-PA16APR2015-KAP. N° de réf. du vendeur 26386920847

Contacter le vendeur

Acheter neuf

EUR 91,85
Autre devise
Frais de port : EUR 7,93
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : 4 disponible(s)

Ajouter au panier

Image d'archives

Andrei, Neculai
Edité par Springer Nature, 2021
ISBN 10 : 3030685160 ISBN 13 : 9783030685164
Neuf Paperback

Vendeur : Revaluation Books, Exeter, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Paperback. Etat : Brand New. 132 pages. 9.25x6.10x0.43 inches. In Stock. N° de réf. du vendeur x-3030685160

Contacter le vendeur

Acheter neuf

EUR 91,36
Autre devise
Frais de port : EUR 11,86
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Andrei, Neculai
Edité par Springer, 2021
ISBN 10 : 3030685160 ISBN 13 : 9783030685164
Neuf Couverture souple
impression à la demande

Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. PRINT ON DEMAND. N° de réf. du vendeur 18386920837

Contacter le vendeur

Acheter neuf

EUR 97,21
Autre devise
Frais de port : EUR 7,95
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 4 disponible(s)

Ajouter au panier

There are 3 autres exemplaires de ce livre sont disponibles

Afficher tous les résultats pour ce livre