✦ LIBER ✦

Generalization of the newton method for one class of nonconvex mathematical programming problems

✍ Scribed by Yu. A. Chernyaev

Publisher: Allerton Press, Inc.
Year: 2008
Tongue: English
Weight: 406 KB
Volume: 52
Category: Article
ISSN: 1066-369X
DOI: 10.1007/s11982-008-1008-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Duality theorems for a class of nonconve

Duality theorems for a class of nonconvex programming problems

✍ O. Rani; R. N. Kaul 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 152 KB

A new accelerating method for globally s

A new accelerating method for globally solving a class of nonconvex programming problems

✍ Peiping Shen; Xiaodi Bai; Weimin Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 591 KB

In this paper, we combine the new global optimization method proposed by Jiao [H. Jiao, A branch and bound algorithm for globally solving a class of nonconvex programming problems, Nonlinear Anal. 70 (2) (2008) 1113-1123] with a suitable deleting technique to propose a new accelerating global optimi

A stable approach to Newton's method for

A stable approach to Newton's method for general mathematical programming problems inRn

✍ R. A. Tapia 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 53 KB

Duality for a class of nondifferentiable

Duality for a class of nondifferentiable mathematical programming problems

✍ Shinji Tanimoto 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 348 KB

A method of solving one class of integer

A method of solving one class of integer programming problems

✍ V.G. Anisimov; E.G. Anisimov 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 332 KB

Global optimization of a class of noncon

Global optimization of a class of nonconvex quadratically constrained quadratic programming problems

✍ Yong Xia 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 194 KB