A Branch and Bound Method for Nonseparable Nonconvex Optimization.

Abstract

In this paper a nonconvex programming algorithms which was developed originally for separable programming problems is formally extended to apply to nonseparable problems also. It is shown that the basic steps of the method can be modified so that separability is no restriction. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1975
Accession Number
ADA021856

Entities

People

  • James K. Hartman

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematical Programming
  • Mathematics
  • Nonconvex Programming
  • Optimization

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Mathematical Modeling and Probability Theory.

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms