✦ LIBER ✦

Discrete minimax problem: Algorithms and numerical comparisons

✍ Scribed by R. Hornung

Book ID: 105508898
Publisher: Springer Vienna
Year: 1982
Tongue: English
Weight: 773 KB
Volume: 28
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02241819

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Erratum: An SQP Algorithm for Finely Dis

Erratum: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions

✍ Zhou, Jian L.; Tits, André L. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 133 KB

Algorithms for the minimax transportatio

Algorithms for the minimax transportation problem

✍ R. K. Ahuja 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 728 KB

Rate of Convergence Analysis of Discreti

Rate of Convergence Analysis of Discretization and Smoothing Algorithms for Semiinfinite Minimax Problems

✍ Royset, J. O.; Pee, E. Y. 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 868 KB

Interval adjustable entropy algorithm fo

Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems

✍ Subei Li; Dexin Cao; Haijun Wang; Kazhong Deng 📂 Article 📅 2004 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 306 KB

Numerical comparisons of three recently

Numerical comparisons of three recently proposed algorithms in the protein folding problem

✍ Hansmann, Ulrich H. E.; Okamoto, Yuko 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB 👁 1 views

We numerically compare the effectiveness of three recently proposed algorithms, multicanonical algorithm, simulations in a 1rk-sampling, and simulated tempering, for the protein folding problem. We perform simulations with high statistics for one of the simplest peptides, met-enkephalin. While the p

A subgradient algorithm for certain mini

A subgradient algorithm for certain minimax and minisum problems

✍ J. A. Chatelon; D. W. Hearn; T. J. Lowe 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 661 KB