"Fixed-Point Algorithms for Inverse Problems in Science and Engineering" presents some of the most recent work from top-notch researchers studying projection and other first-order fixed-point algorithms in several areas of mathematics and the applied sciences. The material presented provides a survey of the state-of-the-art theory and practice in fixed-point algorithms, identifying emerging problems driven by applications, and discussing new approaches for solving these problems.

This book incorporates diverse perspectives from broad-ranging areas of research including, variational analysis, numerical linear algebra, biotechnology, materials science, computational solid-state physics, and chemistry.

Topics presented include:

Theory of Fixed-point algorithms: convex analysis, convex optimization, subdifferential calculus, nonsmooth analysis, proximal point methods, projection methods, resolvent and related fixed-point theoretic methods, and monotone operator theory.

Numerical analysis of fixed-point algorithms: choice of step lengths, of weights, of blocks for block-iterative and parallel methods, and of relaxation parameters; regularization of ill-posed problems; numerical comparison of various methods.

Areas of Applications: engineering (image and signal reconstruction and decompression problems), computer tomography and radiation treatment planning (convex feasibility problems), astronomy (adaptive optics), crystallography (molecular structure reconstruction), computational chemistry (molecular structure simulation) and other areas.

Because of the variety of applications presented, this book can easily serve as a basis for new and innovated research and collaboration.

Semidefinite programming (SDP) is one of the most exciting and active research areas in optimization. It has and continues to attract researchers with very diverse backgrounds, including experts in convex programming, linear algebra, numerical optimization, combinatorial optimization, control theory, and statistics. This tremendous research activity has been prompted by the discovery of important applications in combinatorial optimization and control theory, the development of efficient interior-point algorithms for solving SDP problems, and the depth and elegance of the underlying optimization theory. The Handbook of Semidefinite Programming offers an advanced and broad overview of the current state of the field. It contains nineteen chapters written by the leading experts on the subject. The chapters are organized in three parts: Theory, Algorithms, and Applications and Extensions.

The research of Jonathan Borwein has had a profound impact on optimization, functional analysis, operations research, mathematical programming, number theory, and experimental mathematics. Having authored more than a dozen books and more than 300 publications, Jonathan Borwein is one of the most productive Canadian mathematicians ever. His research spans pure, applied, and computational mathematics as well as high performance computing, and continues to have an enormous impact: MathSciNet lists more than 2500 citations by more than 1250 authors, and Borwein is one of the 250 most cited mathematicians of the period 1980-1999. He has served the Canadian Mathematics Community through his presidency (2000-02) as well as his 15 years of editing the CMS book series. Jonathan Borwein's vision and initiative have been crucial in initiating and developing several institutions that provide support for researchers with a wide range of scientific interests. A few notable examples include the Centre for Experimental and Constructive Mathematics and the IRMACS Centre at Simon Fraser University, the Dalhousie Distributed Research Institute at Dalhousie University, the Western Canada Research Grid, and the Centre for Computer Assisted Research Mathematics and its Applications, University of Newcastle. The workshops that were held over the years in Dr. Borwein's honor attracted high-caliber scientists from a wide range of mathematical fields. This present volume is an outgrowth of the workshop on 'Computational and Analytical Mathematics' held in May 2011 in celebration of Dr. Borwein's 60th Birthday. The collection contains various state-of-the-art research manuscripts and surveys presenting contributions that have risen from the conference, and is an excellent opportunity to survey state-of-the-art research and discuss promising research directions and approaches.

The research of Jonathan Borwein has had a profound impact on optimization, functional analysis, operations research, mathematical programming, number theory, and experimental mathematics. Having authored more than a dozen books and more than 300 publications, Jonathan Borwein is one of the most productive Canadian mathematicians ever. His research spans pure, applied, and computational mathematics as well as high performance computing, and continues to have an enormous impact: MathSciNet lists more than 2500 citations by more than 1250 authors, and Borwein is one of the 250 most cited mathematicians of the period 1980-1999. He has served the Canadian Mathematics Community through his presidency (2000-02) as well as his 15 years of editing the CMS book series. Jonathan Borwein's vision and initiative have been crucial in initiating and developing several institutions that provide support for researchers with a wide range of scientific interests. A few notable examples include the Centre for Experimental and Constructive Mathematics and the IRMACS Centre at Simon Fraser University, the Dalhousie Distributed Research Institute at Dalhousie University, the Western Canada Research Grid, and the Centre for Computer Assisted Research Mathematics and its Applications, University of Newcastle. The workshops that were held over the years in Dr. Borwein's honor attracted high-caliber scientists from a wide range of mathematical fields. This present volume is an outgrowth of the workshop on 'Computational and Analytical Mathematics' held in May 2011 in celebration of Dr. Borwein's 60th Birthday. The collection contains various state-of-the-art research manuscripts and surveys presenting contributions that have risen from the conference, and is an excellent opportunity to survey state-of-the-art research and discuss promising research directions and approaches.

"Fixed-Point Algorithms for Inverse Problems in Science and Engineering" presents some of the most recent work from top-notch researchers studying projection and other first-order fixed-point algorithms in several areas of mathematics and the applied sciences. The material presented provides a survey of the state-of-the-art theory and practice in fixed-point algorithms, identifying emerging problems driven by applications, and discussing new approaches for solving these problems. This book incorporates diverse perspectives from broad-ranging areas of research including, variational analysis, numerical linear algebra, biotechnology, materials science, computational solid-state physics, and chemistry. Topics presented include: Theory of Fixed-point algorithms: convex analysis, convex optimization, subdifferential calculus, nonsmooth analysis, proximal point methods, projection methods, resolvent and related fixed-point theoretic methods, and monotone operator theory. Numerical analysis of fixed-point algorithms: choice of step lengths, of weights, of blocks for block-iterative and parallel methods, and of relaxation parameters; regularization of ill-posed problems; numerical comparison of various methods. Areas of Applications: engineering (image and signal reconstruction and decompression problems), computer tomography and radiation treatment planning (convex feasibility problems), astronomy (adaptive optics), crystallography (molecular structure reconstruction), computational chemistry (molecular structure simulation) and other areas. Because of the variety of applications presented, this book can easily serve as a basis for new and innovated research and collaboration.

Semidefinite programming (SDP) is one of the most exciting and active research areas in optimization. It has and continues to attract researchers with very diverse backgrounds, including experts in convex programming, linear algebra, numerical optimization, combinatorial optimization, control theory, and statistics. This tremendous research activity has been prompted by the discovery of important applications in combinatorial optimization and control theory, the development of efficient interior-point algorithms for solving SDP problems, and the depth and elegance of the underlying optimization theory. The Handbook of Semidefinite Programming offers an advanced and broad overview of the current state of the field. It contains nineteen chapters written by the leading experts on the subject. The chapters are organized in three parts: Theory, Algorithms, and Applications and Extensions.