RITTER'S CUTTING PLANE METHOD FOR NONCONVEX QUADRATIC PROGRAMMING

Abstract

The cutting plane method of K. Ritter for nonconvex quadratic programming is reviewed and placed in the context of principal pivoting methods. The algorithm is illustrated by an example.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1969
Accession Number
AD0699894

Entities

People

  • R. W. Cottle
  • W. C. Mylander

Organizations

  • Stanford University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Classification
  • Computer Programming
  • Contracts
  • Convex Sets
  • Equations
  • Evolutionary Algorithms
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Military Research
  • Nonlinear Programming
  • Operations Research
  • Quadratic Programming
  • Security
  • Simplex Method
  • United States

Fields of Study

  • Mathematics

Readers

  • Operations Research