On a decomposition method for nonconvex global optimization

ISSN： 1862-4472

Source： Optimization Letters, Vol.1, Iss.3, 2007-06, pp. : 245-258

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

Convergence and Application of a Decomposition Method Using Duality Bounds for Nonconvex Global Optimization

By Thoai N.V.

Journal of Optimization Theory and Applications, Vol. 113, Iss. 1, 2002-04 ,pp. : 165-193

Springer Publishing Company

Access to resources Recommend Favorite

Subgradient Method for Nonconvex Nonsmooth Optimization

By Bagirov A.

Journal of Optimization Theory and Applications, Vol. 157, Iss. 2, 2013-05 ,pp. : 416-435

Springer Publishing Company

Access to resources Recommend Favorite

Lagrange Duality and Partitioning Techniques in Nonconvex Global Optimization

By Dür M. Horst R.

Journal of Optimization Theory and Applications, Vol. 95, Iss. 2, 1997-11 ,pp. : 347-369

Springer Publishing Company

Access to resources Recommend Favorite

Global optimization of general non-convex problems with intermediate bilinear substructures

By Zorn Keith Sahinidis Nikolaos V.

Optimization Methods and Software, Vol. 29, Iss. 3, 2014-05 ,pp. : 442-462

Taylor & Francis Ltd

Access to resources Recommend Favorite

Convergence Properties of the Regularized Newton Method for the Unconstrained Nonconvex Optimization

By Ueda Kenji Yamashita Nobuo

Applied Mathematics and Optimization, Vol. 62, Iss. 1, 2010-08 ,pp. : 27-46

Springer Publishing Company

Access to resources Recommend Favorite