Nonlinear Programming Global Optimization Techniques.

Abstract

This report summarizes the results obtained in the area of optimization with non-convex functions. The difficulty is in determining when a local minimum is also a global minimum. The results can be classified into four areas: separable problems, factorable problems, infinitely constrained problems, and other specially structured problems. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1978
Accession Number
ADA061895

Entities

People

  • Anthony V. Fiacco
  • Garth Philip McCormick
  • James E. Falk

Organizations

  • George Washington University

Tags

Communities of Interest

  • Air Platforms
  • Human Systems

DTIC Thesaurus Topics

  • Air Force
  • Air Force Personnel
  • Algorithms
  • Computer Programming
  • Convergence
  • Defense Planning
  • Engineering
  • Evolutionary Algorithms
  • Heuristic Methods
  • Logistics
  • Mathematical Programming
  • Mathematics
  • Models
  • Nonconvex Programming
  • Nonlinear Programming
  • Operations Research
  • Optimization

Readers

  • Approximation Theory.
  • Calculus or Mathematical Analysis
  • Neural Network Machine Learning.