Interval computations - Search Results - UAB Digital Repository of Documents

Search collections:

Sort by:	Display results:	Output format:

Results overview: Found 1 records in 0.03 seconds.
Articles, 1 records found

Articles	1 records found

12 p, 562.9 KB

On proving existence of feasible points in equality constrained optimization problems / Kearfott, R. Baker
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for global optimizers and other contexts, it is of interest to construct bounds around such approximate feasible points, then to verify (computationally but rigorously) that an actual feasible point exists within these bounds. [...]
1998
Mathematical Programming, vol. 83 n. 1 (1998) p. 89-100

UAB restricted access

Detailed record -

Interested in being notified about new results for this query?
Set up a personal email alert or subscribe to the RSS feed.