Improve-and-Branch Algorithm for the Global Optimization of Nonconvex NLP Problems

A new global optimization algorithm for process design: its application to thermal desalination processes

“…The proofs for these affirmations are i~n [1]. In this way, the previous local optimum is not feasible in D~ and D 2.…”

“…The main ideas of the improve-branch algorithm by Marcovecchio et al [ 1 ] are summarized herein. It is a deterministic algorithm that guarantees the e-convergence to the global optimum in a finite time for general NLP problems.…”

Improving the efficiency of the MSF once through (MSF-OT) and MSF-mixer (MSF-M) evaporators

“…2 It is important to note some aspects regarding the simplified model proposed in the "pre-processing phase". A global optimization approach developed by [9] has been applied to the simplified model covering the possible range of the problem parameters --maximum operating temperature, seawater temperature and composition [2]. The same solutions were obtained using local solver CONOPT.…”