Computational mathematical programming

Front Cover
North-Holland, 1987 - Mathematics - 191 pages
0 Reviews
An implicit enumeration procedure for the general linear complementarity problem. Recursive quadratic programming methods based on the augmented lagrangian. A primal truncated newton algorithm with application to large-scale nonlinear network optimization. Approximating some convez programs in terms of borel fields. Computer-assisted analysis for diagnosing infeasible or unbounded linear programs. Ventura, restricted simplicial decomposition: computation and extensions.A note solution on approach to linear programming problems with imprecise function and gradient values. Z; a maany, a new algorithm for highly curved constrained optimization. An implementation of an algorithm for univariate minimization and an application to nested optimization. On practical stopping rules for the simplex method. An experimental approach to karmarkar's projective method for linear programming.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Preface
1
R S Dembo A primal truncated Newton algorithm with application
43
Flam Approximating some convex programs in terms of Borel fields
73
Copyright

5 other sections not shown

Common terms and phrases