✦ LIBER ✦

Some minimization methods for problems with equation-type constraints

✍ Scribed by N.N. Redkovskii

Publisher: Elsevier Science
Year: 1982
Weight: 378 KB
Volume: 22
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(82)90161-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convex minimization problems for integra

Convex minimization problems for integral functionals with constraints of operator inclusion type

✍ V. V. Beresnev 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 426 KB

Iterative methods using lagrange multipl

Iterative methods using lagrange multipliers for solving extremal problems with constraints of the equation type

✍ B.T. Polyak 📂 Article 📅 1970 🏛 Elsevier Science ⚖ 683 KB

A computational method for minimization

A computational method for minimization with nonlinear constraints

✍ R. P. Mikkilineni; T. Feagin 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 632 KB

Integral equation methods for elliptic p

Integral equation methods for elliptic problems with boundary conditions of mixed type

✍ Johan Helsing 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 673 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

Some problems connected with the method

Some problems connected with the method of minimal residuals

✍ V.S. Kozyakin; M.A. Krasnosel'skii 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 240 KB