Andere Kunden interessierten sich auch für
![Operational Research]( "Operational Research")
Operational Research74,99 €![Modeling and Optimization in Space Engineering]( "Modeling and Optimization in Space Engineering")
Modeling and Optimization in Space Engineering74,99 €![Linear and Nonlinear Programming]( "Linear and Nonlinear Programming")
Linear and Nonlinear Programming63,99 €![Introduction to Methods for Nonlinear Optimization]( "Introduction to Methods for Nonlinear Optimization")
Introduction to Methods for Nonlinear Optimization57,99 €![Optimization and Its Applications in Control and Data Sciences]( "Optimization and Its Applications in Control and Data Sciences")
Optimization and Its Applications in Control and Data Sciences74,99 €![Basics of Optimization Theory]( "Basics of Optimization Theory")
Basics of Optimization Theory30,99 €![A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization]( "A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization")
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization37,99 €
Polynomial optimization have been a hot research topic for the past few years and its applications range from Operations Research, biomedical engineering, investment science, to quantum mechanics, linear algebra, and signal processing, among many others. In this brief the authors discuss some important subclasses of polynomial optimization models arising from various applications, with a focus on approximations algorithms with guaranteed worst case performance analysis. The brief presents a clear view of the basic ideas underlying the design of such algorithms and the benefits are highlighted by illustrative examples showing the possible applications.
This timely treatise will appeal to researchers and graduate students in the fields of optimization, computational mathematics, Operations Research, industrial engineering, and computer science.
This timely treatise will appeal to researchers and graduate students in the fields of optimization, computational mathematics, Operations Research, industrial engineering, and computer science.
From the reviews:
"The book is an outgrowth of the first author's Ph.D. thesis, defended in 2011 ... . It is a well-written timely collection of state-of-the-art approximation algorithms for polynomial optimization problems ... . All of the approximation results of the book are conveniently summarized and listed in table 5.1 for quick reference, with a unified nomenclature introduced in sections 1.3.1 and 1.3.2." (Didier Henrion, Mathematical Reviews, March, 2013)
"The book is an outgrowth of the first author's Ph.D. thesis, defended in 2011 ... . It is a well-written timely collection of state-of-the-art approximation algorithms for polynomial optimization problems ... . All of the approximation results of the book are conveniently summarized and listed in table 5.1 for quick reference, with a unified nomenclature introduced in sections 1.3.1 and 1.3.2." (Didier Henrion, Mathematical Reviews, March, 2013)