✦ LIBER ✦

On a set of standad programs for solving problems of non-linear optics

✍ Scribed by A.A. Amosov; A.B. Borisov; V.D. Valedinskii; M.V. Vladimirov; Ya.M. Zhileikin; A.A. Zlotnik; M.A. Kuz'mina

Publisher: Elsevier Science
Year: 1982
Weight: 209 KB
Volume: 22
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(82)90152-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A steepest edge active set algorithm for

A steepest edge active set algorithm for solving sparse linear programming problems

✍ S. W. Sloan 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 863 KB

A steepest edge active set algorithm is described which is suitable for solving linear programming problems where the constraint matrix is sparse and has more rows than columns. The algorithm uses a steepest edge criterion for selecting the search direction at each iteration and recurrence relations

A quantitative method for solving proble

A quantitative method for solving problems of linear dynamic programming

✍ N.P. Naumov 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 804 KB

On the convergence of the spectral metho

On the convergence of the spectral method of solving a problem of non-linear optics

✍ Yu.N. Karamzin; I.L. Tsvetkova 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 364 KB

On a problem of non-linear programming f

On a problem of non-linear programming for unsmooth target functions

✍ Yu.V. Aleksandrov 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 95 KB

A decomposition scheme for solving probl

A decomposition scheme for solving problems of integer-valued linear programming

✍ Yu.M. Pozdnyakov 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 629 KB

An algorithm for solving a structured cl

An algorithm for solving a structured class of linear programming problems

✍ S.Selcuk Erenguc 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 452 KB