𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on ‘new algorithms for constrained minimax optimization’

✍ Scribed by T. F. Coleman

Publisher
Springer-Verlag
Year
1978
Tongue
English
Weight
165 KB
Volume
15
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new computational method for the funct
A new computational method for the functional inequality constrained minimax optimization problem
✍ D.C. Jiang; K.L. Teo; W.Y. Yan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 715 KB

In this paper, we consider a general class of functional inequality constrained minimax optimization problems. This problem is first converted into a semi-infinite programming problem. Then, an auxiliary cost function is constructed based on a positive saturated function. The smallest zero of this a

A note on constrained k-means algorithms
A note on constrained k-means algorithms
✍ Michael K. Ng 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 102 KB

This paper describes extensions to the k-means algorithm for clustering data sets. By adding suitable constraints into the mathematical program formulation, an approach is developed, which allows the use of the k-means paradigm to e$ciently cluster data sets with the "xed number of objects in each c