𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A smoothing-type algorithm for solving system of inequalities

✍ Scribed by Zheng-Hai Huang; Ying Zhang; Wei Wu

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
171 KB
Volume
220
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A nonmonotone smoothing-type algorithm f
A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities
✍ Ying Zhang; Zheng-Hai Huang πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 684 KB

In this paper, we investigate a smoothing-type algorithm with a nonmonotone line search for solving a system of equalities and inequalities. We prove that the nonmonotone algorithm is globally and locally superlinearly convergent under suitable assumptions. The preliminary numerical results are repo

Computational Experience with a Parallel
Computational Experience with a Parallel Algorithm for Tetrangle Inequality Bound Smoothing
✍ Kumar Rajan; Narsingh Deo πŸ“‚ Article πŸ“… 1999 πŸ› Springer 🌐 English βš– 195 KB

Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances can usually be obtained only for a small subset of the n(n-1) 2 atom pairs, using NMR. Given the bounds so obtained on th

A new Lagrangian dual global optimizatio
A new Lagrangian dual global optimization algorithm for solving bilinear matrix inequalities
✍ H. D. Tuan; P. Apkarian; Y. Nakashima πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 202 KB πŸ‘ 2 views

A new global optimization algorithm for solving bilinear matrix inequalities (BMI) problems is developed. It is based on a dual Lagrange formulation for computing lower bounds that are used in a branching procedure to eliminate partition sets in the space of complicating variables. The advantage of