Evaluation Complexity of Algorithms for Nonconvex Optimization

Lingua: inglese

Editore: Society for Industrial and Applied Mathematics,U.S., US, 2022

1611976987 / 9781611976984

Da: Rarewaves.com USA, London, London, Regno UnitoRarewaves.com USA

Venditore con 5 stelle

Venditore AbeBooks dal 11 giugno 2025

Rilegato

Condizione: Nuovo

EUR 128,50

 Spedizione gratuita 
Spedito da Regno Unito a U.S.A.

Quantità: 2 disponibili

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

One of the most popular ways to assess the "effort" needed to solve a problem is to count how many evaluations of the problem functions (and their derivatives) are required. In many cases, this is often the dominating computational cost. Given an optimization problem satisfying reasonable assumptions-and given access to problem-function values and derivatives of various degrees-how many evaluations might be required to approximately solve the problem? Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives addresses this question for nonconvex optimization problems, those that may have local minimizers and appear most often in practice. This is the first bookon complexity to cover topics such as composite and constrained optimization, derivative-free optimization, subproblem solution, and optimal (lower and sharpness) bounds for nonconvex problems,to address the disadvantages of traditional optimality measures and propose useful surrogates leading to algorithms that compute approximate high-order critical points, and to compare traditional and new methods, highlighting the advantages of the latter from a complexity point of view.This is the go-to book for those interested in solving nonconvex problems. It is suitable for advanced undergraduate and graduate students in courses on Advanced Numerical Analysis, Special Topics on Numerical Analysis, Topics on Data Science, Topics on Numerical Optimization, and Topics on Approximation Theory.…

Codice articolo LU-9781611976984

Titolo
Evaluation Complexity of Algorithms for Nonconvex Optimization
Autore
Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis
Editore
Society for Industrial and Applied Mathematics,U.S., US
Anno di pubblicazione
2022
Condizione
New
Rilegatura
Hardback
Lingua
inglese
ISBN 10
1611976987
ISBN 13
9781611976984
Peso dell'articolo
1344 grammi

Rarewaves.com USA

London, London, Regno Unito

Venditore con 5 stelle

Venditore AbeBooks dal 11 giugno 2025

Tariffe di spedizione da Regno Unito a U.S.A.

ArticoloDa 12 a 17 giorni lavorativiDa 12 a 17 giorni lavorativi
Primo articoloEUR 0,00EUR 0,00
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Informazioni sull’azienda del venditore

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, Regno Unito W1W 8BE