DESCENT OF THE BOUNDARY OF A SPHERE,

Abstract

A method is proposed for the problem of minimizing or finding stationary values of a differentiable function f which is constrained to the boundary of the unit sphere in. In the special case that del(f) does not vanish on the unit sphere itself, this is a problem in convex programming, because then the extremal must occur on the boundary of the sphere. In this case, the method of convex programming in a Hilbert space could be used. The general situation, which is not convex programming, is considered. The method of attack follows A. A. Goldstein, 'On Steepest Descent', Feb. 1965, Journal SIAM Control, Vol. 3, No. 1. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1965
Accession Number
AD0624745

Entities

People

  • A. A. Goldstein

Organizations

  • Boeing

Tags

DTIC Thesaurus Topics

  • Boundaries
  • Computer Programming
  • Convex Programming
  • Hilbert Space
  • Mathematics
  • Stationary

Readers

  • Fluid Mechanics and Fluid Dynamics.
  • Linear Algebra
  • Technical Research and Report Writing.

Technology Areas

  • Space