Skip to main content
  • Book
  • © 1996

Rigorous Global Search: Continuous Problems

Authors:

Part of the book series: Nonconvex Optimization and Its Applications (NOIA, volume 13)

Buy it now

Buying options

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (7 chapters)

  1. Front Matter

    Pages i-xv
  2. Preliminaries

    • R. Baker Kearfott
    Pages 1-69
  3. Software Environments

    • R. Baker Kearfott
    Pages 71-112
  4. On Preconditioning

    • R. Baker Kearfott
    Pages 113-144
  5. Verified Solution of Nonlinear Systems

    • R. Baker Kearfott
    Pages 145-167
  6. Optimization

    • R. Baker Kearfott
    Pages 169-208
  7. Non-Differentiable Problems

    • R. Baker Kearfott
    Pages 209-225
  8. Back Matter

    Pages 235-263

About this book

This work grew out of several years of research, graduate seminars and talks on the subject. It was motivated by a desire to make the technology accessible to those who most needed it or could most use it. It is meant to be a self-contained introduction, a reference for the techniques, and a guide to the literature for the underlying theory. It contains pointers to fertile areas for future research. It also serves as introductory documentation for a Fortran 90 software package for nonlinear systems and global optimization. The subject of the monograph is deterministic, automatically verified or r- orous methods. In such methods, directed rounding and computational fix- point theory are combined with exhaustive search (branch and bound) te- niques. Completion of such an algorithm with a list of solutions constitutes a rigorous mathematical proof that all of the solutions within the original search region are within the output list. The monograph is appropriate as an introduction to research and technology in the area, as a desk reference, or as a graduate-level course reference. Kno- edge of calculus, linear algebra, and elementary numerical analysis is assumed.

Authors and Affiliations

  • University of Southwestern Louisiana, USA

    R. Baker Kearfott

Bibliographic Information

Buy it now

Buying options

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access