Complexity in Numerical Optimization

By: PARDALOS P M

Write A Review

Hardcover | 1 December 1992

At a Glance

Hardcover
526 Pages

Dimensions(cm)
22.86 x 15.24 x 3.96

Hardcover

RRP $352.99

$317.75

10%OFF

or 4 interest-free payments of $79.44 with

Ships in 15 to 25 business days

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. This volume 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. This volume should be a valuable source of information to faculty, students and researchers in numerical optimization and related areas.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Mathematics Applied Mathematics Computing & I.T.Computer Science Calculus & Mathematical Analysis Optimisation Game Theory Booktopia Publisher Services World Scientific Publishing

Preface
Average Performance of a Self-Dual Interior Point Algorithm for Linear Programming	p. 1
The Complexity of Approximating a Nonlinear Program	p. 16
Algorithms for the Least Distance Problem	p. 33
Translational Cuts for Convex Minimization	p. 57
Maximizing Concave Functions in Fixed Dimension	p. 74
Approximating the Steiner Minimum Tree	p. 88
The Complexity of Allocating Resources in Parallel: Upper and Lower Bounds	p. 107
Some Bounds on the Complexity of Gradients, Jacobians, and Hessians	p. 128
Complexity Issues in Nonconvex Network Flow Problems	p. 163
Complexity of Smooth Convex Programming and its Applications	p. 180
A Classification of Static Scheduling Problems	p. 203
An O(nL) Iteration Algorithm for Computing Bounds in Quadratic Optimization Problems	p. 254
Complexity of Single Machine Hierarchical Scheduling: A Survey	p. 269
Performance Driven Graph Enhancement Problems	p. 299
Efficient Algorithms for [delta]-Near Planar Graph and Algebraic Problem	p. 323
Parametric Flows, Weighted Means of Cuts, and Fractional Combinatorial Optimization	p. 351
Analysis of a Random Cut Test Instance Generator for the TSP	p. 387
Some Complexity Issues Involved in the Construction of Test Cases for NP-hard Problems	p. 406
Maximizing Non-Linear Concave Functions in Fixed Dimension	p. 429
A Note on the Complexity of Fixed-Point Computation for Noncontractive Maps	p. 448
A Technique for Bounding the Number of Iterations in Path Following Algorithms	p. 462
Polynomial Time Weak Approximation Algorithms for Quadratic Programming	p. 490
Complexity Results for a Class of Min-Max Problems with Robust Optimization Applications	p. 501
Table of Contents provided by Blackwell. All Rights Reserved.

Complexity in Numerical Optimization

At a Glance

Hardcover

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Applied Mathematics

Six Maths Essentials

How to Model the World

Numbers Tell Stories

How Data Can Reveal the Surprising Truths About Our World

The Maths Book

Big Ideas Simply Explained

Introduction to Computational Engineering with MATLAB®

Chapman & Hall/CRC Numerical Analysis and Scientific Computing Series

Mathematics of Uncertainty Applied to Global Issues

Sustainability, Mistreatment of Women, Nuclear Power, Smart Cities, Digitalization

Applied Multivariate Statistical Analysis

Volume 1

Advances in Numerical Methods and Analysis

The Gamma Function (Advanced Topics in Mathematics)

Advanced Topics in Mathematics

Everything Is Predictable

How Bayes' Remarkable Theorem Explains the World

Storytelling with Data Box Set

Six Math Essentials

Mathematical Methods for Physics and Engineering

A Comprehensive Guide

Storytelling with Data

1st Edition - A Data Visualization Guide for Business Professionals

Basic Math & Pre-Algebra For Dummies Book + Workbook Bundle

For Dummies Math & Science

How Not to Be Wrong

The Power of Mathematical Thinking

Engineering Mathematics

5th edition

Bird's Engineering Mathematics

9th Edition

Aerodynamics Principles for Air Transport Pilots

2nd Edition

Swim Training Patterns

1st Edition - Plan your Training Sessions with the Power of Mathematics

Elementary Linear Algebra

8th Edition - International Metric Edition

Invasive Species

Risk Assessment and Management

Introduction to Stochastic Processes

2nd Edition

Intermediate Financial Theory

3rd Edition

The Delicate Art of Brute Force

How to Compute It When You Can't Solve It

This product is categorised by