Attempts to Calculate Global Solutions of Problems that May Have Local Minima,

Abstract

Proposals for obtaining global solutions to not necessarily convex programming problems are examined with emphasis on the associated pitfalls. Included are penalty function methods, Lagrangian Methods, grid methods, special algorithms for structured problems, heuristic methods, random methods, and a branch and bound technique for separable programming problems. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1971
Accession Number
AD0725489

Entities

People

  • Garth P. Mccormick

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Convex Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computational Fluid Dynamics (CFD)
  • Linear Algebra