An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems

Author： Bertsimas Dimitris   Freund Robert M.   Sun Xu Andy  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.28, Iss.3, 2013-06, pp. : 424-441

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

A variational method for unconstrained optimization problems

By  

International Journal of Computer Mathematics, Vol. 84, Iss. 4, 2007-04 ,pp. : 491-503

Taylor & Francis Ltd

Access to resources Recommend Favorite

Globally convergent algorithms for solving unconstrained optimization problems

By  

Optimization, Vol. 64, Iss. 2, 2015-02 ,pp. : 249-263

Taylor & Francis Ltd

Access to resources Recommend Favorite

Globally Convergent Inexact Generalized Newton Method for First-Order Differentiable Optimization Problems

By Pu D.   Zhang J.  

Journal of Optimization Theory and Applications, Vol. 106, Iss. 3, 2000-09 ,pp. : 551-568

Springer Publishing Company

Access to resources Recommend Favorite

A hybrid ODE-based method for unconstrained optimization problems

By Ou Yi-gui  

Computational Optimization and Applications, Vol. 53, Iss. 1, 2012-09 ,pp. : 249-270

Springer Publishing Company

Access to resources Recommend Favorite

Stochastic Method for the Solution of Unconstrained Vector Optimization Problems

By Schäffler S.   Schultz R.   Weinzierl K.  

Journal of Optimization Theory and Applications, Vol. 114, Iss. 1, 2002-07 ,pp. : 209-222

Springer Publishing Company

Access to resources Recommend Favorite