Hasil Pencarian  ::  Simpan CSV :: Kembali

"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."

"Data approximation by low-complexity models details the theory, algorithms, and applications of structured low-rank approximation. Efficient local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. Much of the text is devoted to describing the applications of the theory including, system and control theory, signal processing, computer algebra for approximate factorization and common divisor computation, computer vision for image deblurring and segmentation, machine learning for information retrieval and clustering, bioinformatics for microarray data analysis, chemometrics for multivariate calibration, and psychometrics for factor analysis."

"The approximation of a continuous function by either an algebraic polynomial, a trigonometric polynomial, or a spline, is an important issue in application areas like computer-aided geometric design and signal analysis. This book is an introduction to the mathematical analysis of such approximation, and, with the prerequisites of only calculus and linear algebra. The topics include polynomial interpolation, Bernstein polynomials and the Weierstrass theorem, best approximations in the general setting of normed linear spaces and inner product spaces, best uniform polynomial approximation, orthogonal polynomials, Newton-Cotes , Gauss and Clenshaw-Curtis quadrature, the Euler-Maclaurin formula, approximation of periodic functions, the uniform convergence of Fourier series, spline approximation,with an extensive treatment of local spline interpolation,and its application in quadrature. Exercises are provided at the end of each chapter."

"Contains the proceedings that were prepared in connection with the international conference Approximation Theory XIII, which was held March 7-10, 2010 in San Antonio, Texas. This book includes many relevant topics in approximation theory, such as abstract approximation, approximation with constraints, and interpolation and smoothing."

"This book contains an exposition of several results related with direct and converse theorems in the theory of approximation by algebraic polynomials in a finite interval. In addition, some facts concerning trigonometric approximation that are necessary for motivation and comparisons are included. The selection of papers that are referenced and discussed document some trends in polynomial approximation from the 1950s to the present day."

"These proceedings were prepared in connection with the international conference Approximation Theory XIII, which was held March 7–10, 2010 in San Antonio, Texas. The conference was the thirteenth in a series of meetings in Approximation Theory held at various locations in the United States, and was attended by 144 participants. Previous conferences in the series were held in Austin, Texas (1973, 1976, 1980, 1992), College Station, Texas (1983, 1986, 1989, 1995), Nashville, Tennessee (1998), St. Louis, Missouri (2001), Gatlinburg, Tennessee (2004), and San Antonio, Texas (2007).Along with the many plenary speakers, the contributors to this proceedings provided inspiring talks and set a high standard of exposition in their descriptions of new directions for research. Many relevant topics in approximation theory are included in this book, such as abstract approximation, approximation with constraints, interpolation and smoothing, wavelets and frames, shearlets, orthogonal polynomials, univariate and multivariate splines, and complex approximation."

"This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms."

"Unlike other books on theoretical computer science, this textbook organizes approximation algorithms into chapters based on the design techniques for the algorithms. based on the design techniques for the algorithms. It helps the reader to better understand the design and analysis techniques for approximation algorithms."

"Provides a common setting for various methods of bounding the eigenvalues of a self-adjoint linear operator and emphasizes their relationships. A mapping principle is presented to connect many of the methods. The eigenvalue problems studied are linear, and linearization is shown to give important information about nonlinear problems. Linear vector spaces and their properties are used to uniformly describe the eigenvalue problems presented that involve matrices, ordinary or partial differential operators, and integro-differential operators."

"This monograph deals with a general class of solution approaches in deterministic global optimization, namely the geometric branch-and-bound methods which are popular algorithms, for instance, in Lipschitzian optimization, d.c. programming, and interval analysis.It also introduces a new concept for the rate of convergence and analyzes several bounding operations reported in the literature, from the theoretical as well as from the empirical point of view. Furthermore, extensions of the prototype algorithm for multicriteria global optimization problems as well as mixed combinatorial optimization problems are considered. Numerical examples based on facility location problems support the theory. Applications of geometric branch-and-bound methods, namely the circle detection problem in image processing, the integrated scheduling and location makespan problem, and the median line location problem in the three-dimensional space are also presented.The book is intended for both researchers and students in the areas of mathematics, operations research, engineering, and computer science."