Optimal Scaling of Balls and Polyhedra.

Abstract

A cell means either a nonempty closed polyhedral convex set or a nonempty closed solid ball. The concern is with solving as linear or convex quadratic programs special cases of the optimal containment problem and the optimal meet problem.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1980
Accession Number
ADA090471

Entities

People

  • B. Curtis Eaves
  • R. M. Freund

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • California
  • Computational Complexity
  • Computer Programming
  • Contracts
  • Conversion
  • Convex Sets
  • Interdisciplinary Science
  • Linear Programming
  • Mathematics
  • Military Research
  • Nonlinear Programming
  • Numbers
  • Operations Research
  • Quadratic Programming
  • Universities

Readers

  • Graph Algorithms and Convex Optimization.