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

Author： Marcovecchio Marian   Bergamini María   Aguirre Pio  

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.34, Iss.3, 2006-03, pp. : 339-368

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Robust Solution of Nonconvex Global Optimization Problems

By Tuy Hoang  

Journal of Global Optimization, Vol. 32, Iss. 2, 2005-06 ,pp. : 307-323

Springer Publishing Company

Access to resources Recommend Favorite

On a Local and Global Search Involved in Nonconvex Optimization Problems

By Strekalovsky A. S.   Yakovleva T. V.  

Automation and Remote Control, Vol. 65, Iss. 3, 2004-03 ,pp. : 375-387

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A new global optimization method for univariate constrained twice-differentiable NLP problems

By Chang Min   Park Young   Lee Tai-Yong  

Journal of Global Optimization, Vol. 39, Iss. 1, 2007-09 ,pp. : 79-100

Springer Publishing Company

Access to resources Recommend Favorite

Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm

By Nataraj P.   Arounassalame M.  

Journal of Global Optimization, Vol. 49, Iss. 2, 2011-02 ,pp. : 185-212

Springer Publishing Company

Access to resources Recommend Favorite

On Solving Nonconvex Optimization Problems by Reducing The Duality Gap

By Tuy Hoang  

Journal of Global Optimization, Vol. 32, Iss. 3, 2005-07 ,pp. : 349-365

Springer Publishing Company

Access to resources Recommend Favorite