# Finite-Termination Schemes for Solving Semi-Infinite Satisfying Problems

### Elijah Polak and L. He

###
EECS Department

University of California, Berkeley

Technical Report No. UCB/ERL M90/13

1990

The problem of finding a parameter which satisfies a set of specifications in inequality form is sometimes referred to as the satisfycing problem. We present a family of methods for solving, in a finite number of iterations, satisfycing problems stated in the form of semi-infinite inequalities. These methods range from adaptive uniform discretization methods to outer approximation methods.

BibTeX citation:

@techreport{Polak:M90/13, Author = {Polak, Elijah and He, L.}, Title = {Finite-Termination Schemes for Solving Semi-Infinite Satisfying Problems}, Institution = {EECS Department, University of California, Berkeley}, Year = {1990}, URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1990/1415.html}, Number = {UCB/ERL M90/13}, Abstract = {The problem of finding a parameter which satisfies a set of specifications in inequality form is sometimes referred to as the satisfycing problem. We present a family of methods for solving, in a finite number of iterations, satisfycing problems stated in the form of semi-infinite inequalities. These methods range from adaptive uniform discretization methods to outer approximation methods.} }

EndNote citation:

%0 Report %A Polak, Elijah %A He, L. %T Finite-Termination Schemes for Solving Semi-Infinite Satisfying Problems %I EECS Department, University of California, Berkeley %D 1990 %@ UCB/ERL M90/13 %U http://www.eecs.berkeley.edu/Pubs/TechRpts/1990/1415.html %F Polak:M90/13