1. Augmented Lagrangian algorithms for linear programming

   • O. Güler

   Contributed Papers Pages: 445 - 470

2. An inexact Newton method for nonlinear two-point boundary-value problems

   • E. J. Dean

   Contributed Papers Pages: 471 - 486

3. Gauss-seidel method for least-distance problems

   • W. Li
   • P. M. Pardalos
   • C. G. Han

   Contributed Papers Pages: 487 - 500

4. Trajectory-following algorithms for min-max optimization problems

   • T. L. Vincent
   • B. S. Goh
   • K. L. Teo

   Contributed Papers Pages: 501 - 519

5. Maximum principle and second-order conditions for minimax problems of optimal control

   • A. V. Arutyunov
   • D. B. Silin
   • L. G. Zerkalov

   Contributed Papers Pages: 521 - 533

6. Role of copositivity in optimality criteria for nonconvex optimization problems

   • G. Danninger

   Contributed Papers Pages: 535 - 558

7. Cycles of fear: Periodic bloodsucking rates for vampires

   • R. F. Hartl
   • A. Mehlmann
   • A. Novak

   Contributed Papers Pages: 559 - 568

8. Infinite-dimensional convex programming with applications to constrained approximation

   • V. Jeyakumar

   Contributed Papers Pages: 569 - 586

9. Probabilistic constraints in primal and dual linear programs: Duality results

   • É. Komáromi

   Contributed Papers Pages: 587 - 602

10. Deriving an unconstrained convex program for linear programming

    • J. R. Rajasekera
    • S. C. Fang

    Contributed Papers Pages: 603 - 612

11. New minimax algorithm

    • A. Vardi

    Contributed Papers Pages: 613 - 634

12. Importance of search-domain reduction in random optimization

    • R. Spaans
    • R. Luus

    Technical Note Pages: 635 - 638

13. Book notices

    Announcement Pages: 639 - 639

14. Editorial policy

    General Information Pages: 641 - 642

15. Preparation of papers

    General Information Pages: 643 - 645

16. Editorial addresses

    General Information Pages: 647 - 650