From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems

By Roupin Frédéric  

Journal of Combinatorial Optimization, Vol. 8, Iss. 4, 2004-12 ,pp. : 469-493

Springer Publishing Company

Access to resources Recommend Favorite

Feasible Direction Algorithm for Optimal Control Problems with State and Control Constraints: Implementation

By Pytlak R.   Vinter R.B.  

Journal of Optimization Theory and Applications, Vol. 101, Iss. 3, 1999-06 ,pp. : 623-649

Springer Publishing Company

Access to resources Recommend Favorite

On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems

By Engau Alexander   Anjos Miguel F.   Vannelli Anthony  

Optimization Methods and Software, Vol. 27, Iss. 3, 2012-06 ,pp. : 539-559

Taylor & Francis Ltd

Access to resources Recommend Favorite

An alternating direction method for solving convex nonlinear semidefinite programming problems

By Zhang Su  

Optimization, Vol. 62, Iss. 4, 2013-04 ,pp. : 527-543

Taylor & Francis Ltd

Access to resources Recommend Favorite

A new algorithm for the general quadratic programming problems with box constraints

By Li Jianling   Wang Peng   Ma Lin  

Numerical Algorithms, Vol. 55, Iss. 1, 2010-09 ,pp. : 79-85

Springer Publishing Company

Access to resources Recommend Favorite