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

Author： Engau Alexander Anjos Miguel F. Vannelli Anthony

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

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

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

Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization

By Waki Hayato

Computational Optimization and Applications, Vol. 53, Iss. 3, 2012-12 ,pp. : 823-844

Springer Publishing Company

Access to resources Recommend Favorite

Solving quadratically constrained convex optimization problems with an interior-point method

By Mészáros Csaba

Optimization Methods and Software, Vol. 26, Iss. 3, 2011-06 ,pp. : 421-429

Taylor & Francis Ltd

Access to resources Recommend Favorite

Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems

By Sturm Jos F.

Optimization Methods and Software, Vol. 17, Iss. 6, 2002-01 ,pp. : 1105-1154

Taylor & Francis Ltd

Access to resources Recommend Favorite

Interior-Point Algorithms, Penalty Methods and Equilibrium Problems

By Benson Hande Sen Arun Shanno David Vanderbei Robert

Computational Optimization and Applications, Vol. 34, Iss. 2, 2006-06 ,pp. : 155-182

Springer Publishing Company

Access to resources Recommend Favorite

Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones

By Andreani R.

Optimization, Vol. 60, Iss. 8-9, 2011-08 ,pp. : 1171-1191

Taylor & Francis Ltd

Access to resources Recommend Favorite