#### Filter Results:

#### Publication Year

1996

1998

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

A common strategy for achieving global convergence in the solution of semi-innnite programming (SIP) problems, and in particular of continuous minimax problems, is to (approximately) solve a sequence of discretized problems, with a progressively ner discretization meshes. Finely discretized minimax and SIP problems, as well as other problems with many more… (More)

An error is pointed out in the local convergence proof in the quoted paper SIAM A correct proof is given. The proof of Lemma 3.14 in 2] is incorrect. Namely, proving the claim in the second sentence of the proof does not \complete the proof" as stated. To see this, note that the mathematical induction argument hinted at in that sentence merely proves that,… (More)

- ‹
- 1
- ›