Volume 129, Number 1, September 2011

Special Issue on Cone Programming and its Applications

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

Volume 129, Number 2, October 2011

Special Issue on Large Scale Optimization: Analysis, Algorithms and Applications

• 
  Dimitri P. Bertsekas, Zhi-Quan Luo: Preface. 159-162
• 
  Dimitri P. Bertsekas: Incremental proximal methods for large scale convex optimization. 163-195
• 
  Meisam Razaviyayn, Zhi-Quan Luo, Paul Tseng, Jong-Shi Pang: A stackelberg game approach to distributed spectrum management. 197-224
• 
  Angelia Nedic: Random algorithms for convex minimization problems. 225-253
• 
  Ilan Lobel, Asuman E. Ozdaglar, Diego Feijer: Distributed multi-agent optimization with state-dependent communication. 255-284
• 
  Dongdong Ge, Xiaoye Jiang, Yinyu Ye: A note on the complexity of L_p minimization. 285-299
• 
  Xiaojin Zheng, Xiaoling Sun, Duan Li: Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation. 301-329
• 
  Sangwoon Yun, Paul Tseng, Kim-Chuan Toh: A block coordinate gradient descent method for regularized convex separable optimization and covariance selection. 331-355
• 
  Anthony Man-Cho So: Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems. 357-382
• 
  Etienne de Klerk, Marianna E.-Nagy: On the complexity of computing the handicap of a sufficient matrix. 383-402