Non-Convex Programming for Polynomials.

Abstract

The report develops a numerical solution to the problem of maximizing a polynomial, not necessarily concave, over the closure of a bounded domain in the n-dimensional Euclidean space. As an essential part of this solution algorithms for computing integrals of powers of polynomials are developed. For the general problem of maximizing a function over a region defined by the intersection of non-linear inequalities, a theorem which gives the point of maximum as well as the maximum value of the objective function is stated and proved. Again no assumption on the concavity of the non-linear functions is made. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1972
Accession Number
AD0741635

Entities

People

  • Essam K. Al-hussaini
  • Herman Otto Hartley

Organizations

  • Texas A&M University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Convex Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Inequalities
  • Integrals
  • Mathematics
  • Polynomials

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Graph Algorithms and Convex Optimization.
  • Operations Research

Technology Areas

  • Space