All Areas Submissions  May 2009
Global Optimization
Continuous GRASP with a local activeset method for boundconstrained global optimization
Ernest G. Birgin, Erico M. Gozzi, Mauricio G. C. Resende, Ricardo M. A. Silva
Convex and Nonsmooth Optimization
Continuity of setvalued maps revisited in the light of tame geometry
Aris Daniilidis, C.H. Jeffrey Pang
Applications — Science and Engineering
The L1norm bestfit hyperplane problem
J.P. Brooks, J.H. Dula
Linear, Cone and Semidefinite Programming
A Numerical Algorithm for BlockDiagonal Decomposition of Matrix *Algebras, Part II: General Algorithm
Takanori Maehara, Kazuo Murota
Applications — Science and Engineering
Fast Generation of Potentials for SelfAssembly of Particles
Philip du Toit, Katalin Grubits, Jerrold Marsden, Sorin Costiner
Convex and Nonsmooth Optimization
Iterationcomplexity of firstorder augmented Lagrangian methods for convex programming
Guanghui Lan, Renato D.C. Monteiro
Integer Programming
Constrained Infinite Group Relaxations of MIPs
Santanu Dey, Laurence Wolsey
Integer Programming
Strengthening latticefree cuts using nonnegativity
Ricardo Fukasawa, Oktay Gunluk
Linear, Cone and Semidefinite Programming
Explicit Sensor Network Localization using Semidefinite Representations and Clique Reductions
Nathan Krislock, Henry Wolkowicz
Convex and Nonsmooth Optimization
Cutting Plane Methods and Subgradient Methods
John E. Mitchell
Stochastic Programming
Stochastic Nash Equilibrium Problems: Sample Average Approximation and Applications
Huifu Xu, Zhang Dali
Combinatorial Optimization
Graph Realizations Associated with Minimizing the Maximum Eigenvalue of the Laplacian
Frank Göring, Christoph Helmberg, Susanna Reiss
Convex and Nonsmooth Optimization
Eigenvalue techniques for proving bounds for convex objective, nonconvex programs
Daniel Bienstock
Convex and Nonsmooth Optimization
Analysis and Generalizations of the Linearized Bregman Method
Wotao Yin
