CONVEX PROGRAMMING - DUAL ALGORITHM

Abstract

An algorithm is given for nonlinear programs where the objective as well as inequality constraints are convex functions. This algorithm consists of finding an equivalent ''generalized linear program'' where the standard procedure for determining the candidate to enter the basis is replaced by an auxiliary nonlinear program where the nonlinear constraints of the original problem have disappeared. The algorithm described is very close to Dantzig's algorithm, but the relations between the two algorithms are not yet well established.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 16, 1963
Accession Number
AD0420005

Entities

People

  • Pierre Huard

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • California
  • Convex Programming
  • Evolutionary Algorithms
  • Government Procurement
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Military Research
  • Navy
  • New Jersey
  • New York
  • Operations Research
  • Rhode Island
  • Standards
  • United States

Readers

  • Operations Research