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

ISSN： 0022-3239

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

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

On a decomposition method for nonconvex global optimization

By Tuy Hoang

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

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

Abstract convexity for nonconvex optimization duality

By Nedic A.

Optimization, Vol. 56, Iss. 5-6, 2007-10 ,pp. : 655-674

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

Global Convergence of a Memory Gradient Method for Unconstrained Optimization

By Narushima Yasushi Yabe Hiroshi

Computational Optimization and Applications, Vol. 35, Iss. 3, 2006-11 ,pp. : 325-346

Springer Publishing Company

Access to resources Recommend Favorite