✦ LIBER ✦

On a Local and Global Search Involved in Nonconvex Optimization Problems

✍ Scribed by A.S. Strekalovsky; T.V. Yakovleva

Book ID: 111572362
Publisher: SP MAIK Nauka/Interperiodica
Year: 2004
Tongue: English
Weight: 169 KB
Volume: 65
Category: Article
ISSN: 0005-1179
DOI: 10.1023/b:aurc.0000019368.45522.7a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local search in problems with nonconvex

Local search in problems with nonconvex constraints

✍ T. V. Gruzdeva; A. S. Strekalovsky 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 238 KB

On a sequential search strategy in globa

On a sequential search strategy in global optimization problems

✍ F. Schoen 📂 Article 📅 1982 🏛 Springer Milan 🌐 English ⚖ 474 KB

Global Solution Approach for a Nonconvex

Global Solution Approach for a Nonconvex MINLP Problem in Product Portfolio Optimization

✍ Xiaoxia Lin; Christodoulos A. Floudas; Josef Kallrath 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 290 KB

Integrating Interval Estimates of Global

Integrating Interval Estimates of Global Optima and Local Search Methods for Combinatorial Optimization Problems

✍ Irfan M. Ovacik; Srikanth Rajagopalan; Reha Uzsoy 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 133 KB

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

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