A Parametric Bounding Method for Finding a Minimum (l sub infinity) -Norm Solution to a System of Equations.

Abstract

This paper presents a method for finding the minimum (l sub infinity)-norm solution to a set of consistent linear equations using a form of parametric linear programming. In this application the upper and lower bounds of all the variables are parametrized, and the author works with only the original variables and constraints. Computational results indicate that the method is superior to both a primitive linear programming approach to the problem and to other, more specialized methods, which have been suggested.

Document Details

Document Type
Technical Report
Publication Date
May 01, 1975
Accession Number
ADA012992

Entities

People

  • J. A. Tomlin

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Contracts
  • Equations
  • Linear Programming
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Linear Algebra