✦ LIBER ✦

A computational method for minimization with nonlinear constraints

✍ Scribed by R. P. Mikkilineni; T. Feagin

Publisher: Springer
Year: 1978
Tongue: English
Weight: 632 KB
Volume: 25
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00932897

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Existence for minimization with nonconve

Existence for minimization with nonconvex constraints

✍ D Motreanu 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 471 KB

A constraint linearization method for no

A constraint linearization method for nondifferentiable convex minimization

✍ Krzysztof C. Kiwiel 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 934 KB

Some minimization methods for problems w

Some minimization methods for problems with equation-type constraints

✍ N.N. Redkovskii 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 378 KB

A combined relaxation method for variati

A combined relaxation method for variational inequalities with nonlinear constraints

✍ Igor V. Konnov 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 732 KB

A variance algorithm for constrained min

A variance algorithm for constrained minimization with linear constraints

✍ R Chattopadhyay 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 394 KB

Variations on a cutting plane method for

Variations on a cutting plane method for solving concave minimization problems with linear constraints

✍ A. Victor Cabot 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 534 KB

## Abstract A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates th