All Areas Submissions  August 2008
Applications — Science and Engineering
The N  k Problem in Power Grids: New Models, Formulations and Computation
Daniel Bienstock, Abhinav Verma
Convex and Nonsmooth Optimization
On the String Averaging Method for Sparse Common Fixed Points Problems
Yair Censor, Alexander Segal
Integer Programming
Branching and bounds tightening techniques for nonconvex MINLP
Pietro Belottti, Jon Lee, Leo Liberti, Francois Margot, Andreas Wachter
Integer Programming
On the Relative Strength of Split, Triangle and Quadrilateral Cuts
Amitabh Basu, Pierre Bonami, Gerard Cornuejols, Francois Margot
Convex and Nonsmooth Optimization
Efficient Methods for Stochastic Composite Optimization
Guanghui Lan
Convex and Nonsmooth Optimization
Optimal steepest descent algorithms for unconstrained convex problems: fine tuning Nesterov's method
Clóvis Caesar Gonzaga, Elizabeth Wegner Karas
Linear, Cone and Semidefinite Programming
Strong Duality and Minimal Representations for Cone Optimization
Levent Tuncel, Henry Wolkowicz
Other Topics
Minimum Dissatisfaction Personnel Scheduling
Mugurel Ionut Andreica, Romulus Andreica, Angela Andreica
Linear, Cone and Semidefinite Programming
Strange Behaviors of Interiorpoint Methods for Solving Semidefinite Programming Problems in Polynomial Optimization
Hayato Waki, Maho Nakata, Masakazu Muramatsu
Linear, Cone and Semidefinite Programming
Fourier analysis, linear programming, and densities of distance avoiding sets in R^n
Fernando M. de Oliveira Filho, Frank Vallentin
Convex and Nonsmooth Optimization
An efficient TVL1 algorithm for deblurring multichannel images corrupted by impulsive noise
Junfeng Yang, Yin Zhang, Wotao Yin
Integer Programming
Convex Relaxations of NonConvex Mixed Integer Quadratically Constrained Programs: Extended Formulations
Anureet Saxena, Pierre Bonami, Jon Lee
Linear, Cone and Semidefinite Programming
A new library of structured semidefinite programming instances
Etienne De Klerk, Renata Sotirov
Convex and Nonsmooth Optimization
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
E. Alper YILDIRIM, S. Damla AHIPASAOGLU
Integer Programming
Improved strategies for branching on general disjunctions
Gerard Cornuejols, Leo Liberti, Giacomo Nannicini
Combinatorial Optimization
NearOptimal Solutions and Integrality Gaps for Almost All Instances of SingleMachine PrecedenceConstrained Scheduling
Andreas S. Schulz, Nelson A. Uhan
Applications — Science and Engineering
An SDPbased divideandconquer algorithm for graph realization
NgaiHang Z. Leung, KimChuan Toh
Complementarity and Variational Inequalities
Projections Onto SuperHalfSpaces for Monotone Variational Inequality Problems in FiniteDimensional Spaces
Yair Censor, Aviv Gibali
Stochastic Programming
The Facility Location Problem with Bernoulli Demands
Maria AlbaredaSambola, Elena Fernandez, Francisco SaldanhadaGama
Nonlinear Optimization
A Subspace Limited Memory BFGS Algorithm For Box Constrained Optimization
Wei Zengxin, Wu Yanlin, Yuan Gonglin
Convex and Nonsmooth Optimization
Dynamic Subgradient Methods
Gregory Emiel, Claudia Sagastizabal
