A Primal-Dual Method for Minimization with Linear Constraints

Abstract

The purpose of the report is to develop a general algorithm for solving the class of nonlinear programming problems that have linear constraints. The constraints can be either equations or inequalities and the variables can be free or non-negative. The objective function is assumed to be continuously differentiable. The algorithm is an 'effective' second-order method in that slow convergence is eliminated without requiring second partial derivatives. In addition it combines the desirable features of projection methods, conjugate gradient methods, and methods that solve LP problems to obtain feasible directions. Computational results on a wide variety of test problems are given. Some comments on the efficiency of the algorithm as compared to other algorithms is included.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1973
Accession Number
AD0758635

Entities

People

  • Gordon B. Hatfield

Organizations

  • United States Naval Research Laboratory

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Classification
  • Computer Programming
  • Computers
  • Convergence
  • Ellipsoids
  • Linear Programming
  • Mathematical Programming
  • Military Research
  • Naval Personnel
  • Navy
  • Nonlinear Programming
  • Operations Research
  • Optimization
  • Personnel Management
  • Training

Fields of Study

  • Mathematics

Readers

  • Operations Research