Global Optimization with Non-Convex Constraints
Roman G. Strongin
Reading Time
at 250 WPM11h 44m
The average reader, reading at a speed of 250 WPM, would take 11h 44m to read Global Optimization with Non-Convex Constraints.
Personalise your estimate by entering your reading speed below
Test my reading speedEnter speed in words per minute
24
days at 30 min/day
704
total minutes
Global Optimization with Non-Convex Constraints
by Roman G. Strongin, Yaroslav D. Sergeyev
Published
2013
Publisher
Springer
Pages
704
ISBN-13
9781461371175
Description
This book presents a new approach to global non-convex constrained optimization. Problem dimensionality is reduced via space-filling curves. To economize the search, constraint is accounted separately (penalties are not employed). The multicriteria case is also considered. All techniques are generalized for (non-redundant) execution on multiprocessor systems. Audience: Researchers and students working in optimization, applied mathematics, and computer science.
Subjects
Frequently Asked Questions
How many pages are in Global Optimization with Non-Convex Constraints?
This edition of Global Optimization with Non-Convex Constraints has approximately 704 pages. Please note, this is an estimate and the exact page count can vary between hardcover, paperback, and e-book versions.
How long does it take to read Global Optimization with Non-Convex Constraints?
For most readers, Global Optimization with Non-Convex Constraints typically takes between 14h 40m and 9h 47m to complete. This is based on the book's length of approximately 176,000 words and common reading speeds.
Here's a detailed breakdown: • Continuous reading at 250 WPM: approximately 11h 44m of focused reading • Casual reading (30 minutes/day): you could finish in roughly 24 days • Estimated word count: 176,000 words
Your individual reading time will vary based on your personal reading pace, the amount of daily reading time, and your familiarity with the subject matter.
What is the word count of Global Optimization with Non-Convex Constraints?
The estimated word count for Global Optimization with Non-Convex Constraints is approximately 176,000 words. This figure is calculated using industry-standard methods that consider genre-specific word density patterns, typical formatting and layout characteristics, and standard words-per-page ratios for published books.
This is an approximation — actual word count may vary based on font size, formatting, edition, and the presence of illustrations or charts.
Who is the author of Global Optimization with Non-Convex Constraints?
Global Optimization with Non-Convex Constraints was written by Roman G. Strongin, Yaroslav D. Sergeyev.
When was Global Optimization with Non-Convex Constraints published?
The publication date for this specific edition is 2013. The original work may have been published on a different date.