Logo - springer
Slogan - springer

Mathematics - Computational Science & Engineering | Stationarity and Convergence in Reduce-or-Retreat Minimization

Stationarity and Convergence in Reduce-or-Retreat Minimization

Levy, Adam B.

2012, XII, 55 p. 3 illus., 1 illus. in color.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$39.95

(net) price for USA

ISBN 978-1-4614-4642-2

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$49.95

(net) price for USA

ISBN 978-1-4614-4641-5

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • ​​Analyzes an innovative unifying framework for a wide variety of numerical methods​ in optimization
  • Inspires new convergence analyses for existing methods in numerical optimization​
  • Extends and broadens the traditional convergence analyses 
​​​​​​ Stationarity and Convergence in Reduce-or-Retreat Minimization presents and analyzes a unifying framework for a wide variety of numerical methods in optimization. The author’s “reduce-or-retreat” framework is a conceptual method-outline that covers any method whose iterations choose between reducing the objective in some way at a trial point, or retreating to a closer set of trial points. The alignment of various derivative-based methods within the same framework encourages the construction of new methods, and inspires new theoretical developments as companions to results from across traditional divides. The text illustrates the former by developing two generalizations of classic derivative-based methods which accommodate non-smooth objectives, and the latter by analyzing these two methods in detail along with a pattern-search method and the famous Nelder-Mead method.In addition to providing a bridge for theory through the “reduce-or-retreat” framework, this monograph extends and broadens the traditional convergence analyses in several ways. Levy develops a generalized notion of approaching stationarity which applies to non-smooth objectives, and explores the roles of the descent and non-degeneracy conditions in establishing this property. The traditional analysis is broadened by considering “situational” convergence of different elements computed at each iteration of a reduce-or-retreat method. The “reduce-or-retreat” framework described in this text covers specialized minimization methods, some general methods for minimization and a direct search method, while providing convergence analysis which complements and expands existing results.​ ​

Content Level » Research

Keywords » convergence analysis - derivative-free methods - non-smooth analysis - numerical methods - reduce or retreat methods in optimization

Related subjects » Computational Science & Engineering - Mathematics - Probability Theory and Stochastic Processes

Table of contents 

-1. A Framework for Reduce-or-Retreat Minimization. -2. Particular Reduce-or-Retreat Methods. -3. Scenario Analysis.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithms.