MARC details
000 -Record Label |
fixed length control field |
02900nam a22002895i 4500 |
005 - Identificador da versão |
control field |
20240312134735.0 |
010 ## - ISBN - International Standard Book Number |
Número (ISBN) |
978-3-030-68517-1 |
Modalidade de aquisição e/ou preço |
compra |
100 ## - Entrada principal |
Dados gerais de processamento |
20231023d2021 k||y0pory50 ba |
101 0# - Língua do documento |
Língua do texto, banda sonora, etc. |
eng |
102 ## - País da publicação |
País de publicação |
Switzerland, Swiss Confederation |
Localidade de publicação |
Cham |
200 1# - Título |
Título próprio |
A derivative-free two level random search method for unconstrained optimization |
Indicação geral da natureza do documento |
Documento eletrónico |
Primeira menção de responsabilidade |
Neculai Andrei |
210 ## - Local de edição |
Lugar da edição, distribuição, etc. |
Cham |
Nome do editor, distribuidor, etc. |
Springer International Publishing |
Data da publicação, distribuição, etc. |
2021 |
215 ## - Descrição física (Vol.pg.fl.tm.fsc) |
Descrição física |
XI, 118 p. |
Outras indicações físicas |
il. |
225 2# - Coleção |
Título próprio da colecção |
SpringerBriefs in Optimization |
303 ## - Notas Informação descritiva |
Texto da nota |
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. |
606 ## - Nome comum como assunto |
Elemento de entrada |
Mathematical optimization |
606 ## - Nome comum como assunto |
Elemento de entrada |
Operations research |
606 ## - Nome comum como assunto |
Elemento de entrada |
Management science |
680 ## - Classificação Biblioteca Congresso |
Notação |
QA402.5-402.6 |
700 ## - Autor (resp. principal) |
Koha Internal Code |
60273 |
Palavra de ordem |
Andrei |
Outra parte do nome |
Neculai |
801 #0 - Fonte de origem |
País |
Portugal |
Regras de catalogação |
RPC |
856 4# - URL Endereço WEB |
URL |
https://doi.org/10.1007/978-3-030-68517-1 |
942 ## - Elementos de entrada adicionados (Koha) |
Fonte da classificação ou esquema de estante |
Library of Congress Classification |
Tipo de item no Koha |
E-Books |
Suprimido |
0 |