Volume 129, Issue 1 | Mathematical Programming

New Content Item

Mathematical Programming

A Publication of the Mathematical Optimization Society

Publishing model:: Hybrid

Submit your manuscript

Search all Mathematical Programming articles

Volume 129, Issue 1

September 2011

Special Issue on Cone Programming and its Applications

Issue Editors:

Miguel F. Anjos,
Etienne Klerk,
Franz Rendl

7 articles in this issue

Preface
Miguel F. Anjos
Etienne de Klerk
Franz Rendl
Preface 11 May 2011 Pages: 1 - 3
Bilinear optimality constraints for the cone of positive polynomials
Gábor Rudolf
Nilay Noyan
Farid Alizadeh
Full Length Paper 22 May 2011 Pages: 5 - 31
Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
Sunyoung Kim
Masakazu Kojima
Makoto Yamashita
Full Length Paper 13 August 2010 Pages: 33 - 68
Nuclear norm minimization for the planted clique and biclique problems
Brendan P. W. Ames
Stephen A. Vavasis
Full Length Paper 18 May 2011 Pages: 69 - 89
Numerical block diagonalization of matrix *-algebras with application to semidefinite programming
Etienne de Klerk
Cristian Dobre
Dmitrii V. Ṗasechnik
Full Length Paper Open access 22 May 2011 Pages: 91 - 111
On bar frameworks, stress matrices and semidefinite programming
A. Y. Alfakih
Full Length Paper 07 July 2010 Pages: 113 - 128
Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
Xiaowei Bao
Nikolaos V. Sahinidis
Mohit Tawarmalani
Full Length Paper 18 May 2011 Pages: 129 - 157