Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Iterative methods (Mathematics) --- Linear operators --- Spectrum analysis --- Itération (Mathématiques) --- Opérateurs linéaires --- Analyse spectrale --- Operator theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Itération (mathématiques) --- Analyse numérique --- Numerical analysis. --- Iterative methods (Mathematics) --- Equations algebriques lineaires --- Calcul matriciel --- Methodes numeriques

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

"This book covers iterative optimization methods that stems from inverse problems and related issues. The author presents the theoretical side of inverse methods and as a result ignores discrete problems, stochastic methods, and combinatorial optimization. The coverage moves from an introduction of auxiliary function methods to a discussion of several examples of auxiliary fixed (AF) point methods in optimization to consideration of related topics such as operator fixed point methods. A few problems have been scattered throughout the book so that it might be used in a special topics class on optimization at the graduate level"--

Inverse problems (Differential equations) --- Algorithms. --- Iterative methods (Mathematics) --- Problèmes inversés (Equations différentielles) --- Algorithmes --- Itération (Mathématiques)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.

Iterative methods (Mathematics) --- Combinatorial optimization --- Itération (Mathématiques) --- Optimisation combinatoire --- Combinatorial optimization. --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Iteration (Mathematics) --- Numerical analysis --- Iterative methods (Mathematics).

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Mathematical analysis --- Numerical solutions of algebraic equations --- Infinite matrices. --- Transformations (Mathematics) --- Iterative methods (Mathematics) --- Matrices infinies --- Transformations (Mathématiques) --- Itération (Mathématiques) --- 51 <082.1> --- Mathematics--Series --- Transformations (Mathématiques) --- Itération (Mathématiques)