On proving existence of feasible points in equality constrained optimization problems

  title={On proving existence of feasible points in equality constrained optimization problems},
  author={R. Baker Kearfott},
  journal={Math. Program.},
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. Hansen and others have proposed techniques for proving the existence of feasible points within… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 20 references

An interval algorithm for constrained global optimization

  • M. A. Wolfe
  • J. Comput. Appl. Math.,
  • 1994
Highly Influential
7 Excerpts

Rigorous Global Search Methods for Continuous Problems

  • R. B. Kearfott
  • 1996
Highly Influential
10 Excerpts

Interval Methods for Systems of Equations

  • A. Neumaier
  • 1990
Highly Influential
4 Excerpts

Epsilon–inflation in verification

  • G. Mayer
  • Postfach 6980,
  • 1993
1 Excerpt

Methodologies for tolerance intervals

  • B. P. Kristinsdottir, Z. B. Zabinsky, T. Csendes, M. E. Tuttle
  • Interval Computations,
  • 1993

Similar Papers

Loading similar papers…