Advances in Optimization and Approximation

by Ding-Zhu Du (Editor), Jie Sun (Editor)

Overview

This book is a collection of research papers in optimization and approximation dedicated to Professor Minyi Yue of the Institute of Applied Mathematics, Beijing, China. The papers provide a broad spectrum of research on optimization problems, including scheduling, location, assignment, linear and nonlinear programming problems as well as problems in molecular biology. The emphasis of the book is on algorithmic aspects of research work in optimization. Special attention is paid to approximation algorithms, including heuristics for combinatorial approximation problems, approximation algorithms for global optimization problems, and applications of approximations in real problems.
The work provides the state of the art for researchers in mathematical programming, operations research, theoretical computer science and applied mathematics.

Product Details

ISBN-13:	9780792327851
Publisher:	Springer US
Publication date:	05/31/1994
Series:	Nonconvex Optimization and Its Applications , #1
Edition description:	1994
Pages:	390
Product dimensions:	6.10(w) x 9.25(h) x 0.04(d)

Table of Contents

Preface. Scheduling Multiprocessor Flow Shops; Bo Chen. The k-Walk Polyhedron; C.R. Coullard, A.B. Gamble, Jin Liu. Two Geometric Optimization Problems; B. Dasgupta, V. Roychowdhury. A Scaled Gradient Projection Algorithm for Linear Complementarity Problems; Jiu Ding. A Simple Proof for a Result of Ollerenshaw on Steiner Trees; Xiufeng Du, Ding-Zhu Du, Biao Gao, Lixue Qü. Optimization Algorithms for the Satisfiability (SAT) Problem; Jun Gu. Ergodic Convergence in Proximal Point Algorithms with Bregman Functions; O. Güler. Adding and Deleting Constraints in the Logarithmic Barrier Method for LP; D. den Hertog, C. Roos, T. Terlaky. A Projection Method for Solving Infinite Systems of Linear Inequalities; Hui Hu. Optimization Problems in Molecular Biology; Tao Jiang, Ming Li. A Dual Affine Scaling Based Algorithm for Solving Linear Semi-Infinite Programming Problems; Chih-Jen Lin, Shu-Cherng Fang, Soon-Yi Wu. A Genuine Quadratically Convergent Polynomial Interior Point Algorithm for Linear Programming; Zhi-Quan Luo, Yinyu Ye. A Modified Barrier Function Method for Linear Programming; M.R. Osborne. A New Facet Class and a Polyhedral Method for the Three-Index Assignment Problem; Liqun Qi, E. Balas, G. Gwan. A Finite Simplex-Active-Set Method for Monotropic Piecewise Quadratic Programming; R.T. Rockafellar, Jie Sun. A New Approach in the Optimization of Exponential Queues; S.H. Xu. The Euclidean Facilities Location Problem; Guoliang Xue, Changyu Wang. Optimal Design of Large-Scale Opencut Coal Mine System; Dezhuang Yang. On the Strictly Complementary Slackness Relation in Linear Programming; Shuzhong Zhang. Analytical Properties of the Central Trajectory in Interior Point Methods; Gongyun Zhao,Jishan Zhu. TheApproximation of Fixed Points of Robust Mappings; Quan Zheng, Deming Zhuang.