NONLINEAR PROGRAMS WITH POSITIVELY BOUNDED JACOBIANS

Abstract

This report is concerned with properties and solution methods for inequality-constrained extremization problems. Generally, the problems can be put as follows: minimize f sub 0(x) constrained by f sub i(x) <0, 1 < i < m, where the f sub i(0 < i < m) are real-valued functions defined on real n-space.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 22, 1964
Accession Number
AD0605549

Entities

People

  • Richard Cottle

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • California
  • Convex Programming
  • Convex Sets
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Navy
  • New Jersey
  • New York
  • Nonlinear Programming
  • Operations Research
  • Quadratic Programming
  • Real Variables
  • Theorems
  • United States

Fields of Study

  • Mathematics

Readers

  • Linear Algebra
  • Operations Research

Technology Areas

  • Space
  • Space - Spacecraft Maneuvers