𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reduction constraints for the global optimization of NLPs

✍ Scribed by Leo Liberti

Book ID
111205729
Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
112 KB
Volume
11
Category
Article
ISSN
0969-6016

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Improve-and-Branch Algorithm for the Glo
Improve-and-Branch Algorithm for the Global Optimization of Nonconvex NLP Problems
✍ Marian G. Marcovecchio; MarΓ­a L. Bergamini; Pio A. Aguirre πŸ“‚ Article πŸ“… 2006 πŸ› Springer US 🌐 English βš– 320 KB

A new algorithm to solve nonconvex NLP problems is presented. It is based on the solution of two problems. The reformulated problem RP is a suitable reformulation of the original problem and involves convex terms and concave univariate terms. The main problem MP is a nonconvex NLP that outer-approxi