๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions

โœ Scribed by Le Dung Muu; Thai Quynh Phong; Pham Dinh Tao

Publisher
Springer US
Year
1995
Tongue
English
Weight
704 KB
Volume
4
Category
Article
ISSN
0926-6003

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

The FETI family of domain decomposition
The FETI family of domain decomposition methods for inequality-constrained quadratic programming: Application to contact problems with conforming and nonconforming interfaces
โœ Philip Avery; Charbel Farhat ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 372 KB

Two domain decomposition methods with Lagrange multipliers for solving iteratively quadratic programming problems with inequality constraints are presented. These methods are based on the FETI and FETI-DP substructuring algorithms. In the case of linear constraints, they do not perform any Newton-li