THE SEQUENTIAL UNCONSTRAINED MINIMIZATION TECHNIQUE WITHOUT PARAMETERS.

Abstract

For solving convex programming problems an unconstrained minimization technique that involves no parameter selection is presented. The iterations depend only on the initial value of the objective function. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1966
Accession Number
AD0643818

Entities

People

  • Anthony V. Fiacco
  • Garth P. Mccormick

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Computing-Related Activities
  • Convex Programming
  • Interdisciplinary Science
  • Iterations
  • Mathematical Analysis
  • Mathematical Programming
  • Mathematics
  • Numerical Analysis

Readers

  • Calculus or Mathematical Analysis
  • Regression Analysis.