|About the Book|
Computational complexity, originated from the interactions between computer science and numerical optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty.The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable.The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions.This book is a collection of articles on recent complexity developments in numerical optimization. The topics covered include complexity of approximation algorithms, new polynomial time algorithms for convex quadratic minimization, interior point algorithms, complexity issues regarding test generation of NP-hard problems, complexity of scheduling problems, min-max, fractional combinatorial optimization, fixed point computations and network flow problems.The collection of articles provide a broad spectrum of the direction in which research is going and help to elucidate the nature of computational complexity in optimization. The book will be a valuable source of information to faculty, students and researchers in numerical optimization and related areas.Contents: Average Performance of a Self-Dual Interior Point Algorithm for Linear Programming (K M Anstreicher et al.)The Complexity of Approximating a Nonlinear Program (M Bellare & P Rogaway)Algorithms for the Least Distance Problem (P Berman et al.)Translational Cuts for Convex Minimization (J V Burke et al.)Maximizing Concave Functions in Fixed Dimension (E Cohen & N Megiddo)The Complexity of Allocating Resources in Parallel: Upper and Lower Bounds (E J Friedman)Complexity Issues in Nonconvex Network Flow Problems (G M Guisewite & P M Pardalos)A Classification of Static Scheduling Problems (J W Herrmann et al.)Complexity of Single Machine Hierarchical Scheduling: A Survey (C-Y Lee & G Vairaktarakis)Performance Driven Graph Enchancement Problems (D Paik & S Sahni)Parametric Flows, Weighted Means of Cuts, and Fractional Combinatorial Optimization (T Radzik)Some Complexity Issues Involved in the Construction of Test Cases for NP-Hard Problems (L A Sanchis)Maximizing Nonlinear Concave Functions in Fixed Dimension (S Toledo)A Note on the Complexity of Fixed-Point Computation for Noncontractive Maps (C W Tsay & K Sikorski)Polynomial Time Weak Approximation Algorithms for Quadratic Programming (S A Vavasis)Complexity Results for a Class of Min-Max Problems with Robust Optimization Applications (G Yu & P Kouvelis)and other papersReadership: Applied mathematicians and computer scientists.