All Areas Submissions  July 2011
Combinatorial Optimization
An Improved Exact Algorithm for the First Player's Strategy in the Discrete Oneround Voronoi Game
Marcos Costa Roboredo, Artur Alves Pessoa
Stochastic Programming
The optimal harvesting problem with price uncertainty
Bernardo Pagnoncelli, Adriana Piazza
Linear, Cone and Semidefinite Programming
Implementing the simplex method as a cuttingplane method
Csaba I. Fabian, Olga Papp, Krisztian Eretnek
Linear, Cone and Semidefinite Programming
On the setsemidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
Gabriele Eichfelder, Janez Povh
Applications — Science and Engineering
RealTime Optimization Strategies for Building Systems
Victor Zavala
Linear, Cone and Semidefinite Programming
How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
Hayato Waki
Integer Programming
Solving Mixed Integer Bilinear Problems using MIP formulations
Akshay Gupte, Shabbir Ahmed, Myun Seok Cheon, Santanu S. Dey
Infinite Dimensional Optimization
Quadratic order conditions for bangsingular extremals
M. Soledad Aronna, J. Frederic Bonnans, Andrei V. Dmitruk, Pablo A. Lotito
Convex and Nonsmooth Optimization
Iteration Complexity of Randomized BlockCoordinate Descent Methods for Minimizing a Composite Function
Peter Richtarik, Martin Takac
Convex and Nonsmooth Optimization
The mesh adaptive direct search algorithm with treed Gaussian process surrogates
Robert B. Gramacy, Sébastien Le Digabel
Global Optimization
Line search methods with variable sample size for unconstrained optimization
Nataša Krejić, Nataša Krklec
Convex and Nonsmooth Optimization
Fast FirstOrder Methods for Stable Principal Component Pursuit
Necdet Serhat Aybat, Donald Goldfarb, Garud Iyengar
Integer Programming
Column Generation for Extended Formulations
Ruslan Sadykov, Francois Vanderbeck
Convex and Nonsmooth Optimization
Approximation of rank function and its application to the nearest lowrank correlation matrix
shujun Bi, shaohua Pan
Global Optimization
Representing quadratically constrained quadratic programs as generalized copositive programs
Samuel Burer, Hongbo Dong
Integer Programming
Strong Dual for Conic MixedInteger Programs
Santanu S. Dey, Diego A. Moran R., Juan Pablo Vielma
Complementarity and Variational Inequalities
On the O(1/t) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
Bingsheng He
Global Optimization
Global optimization of expensive black box problems with a known lower bound
Andrea Cassioli, Fabio Schoen
Integer Programming
On the generation of symmetry breaking constraints for mathematical programs
Leo Liberti, James Ostrowski
Convex and Nonsmooth Optimization
InfeasiblePoint Subgradient Algorithm and Computational Solver Comparison for l1Minimization
Dirk A. Lorenz, Marc E. Pfetsch, Andreas M. Tillmann
Nonlinear Optimization
A Note About The Complexity Of Minimizing Nesterov's Smooth ChebyshevRosenbrock Function
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Applications — Science and Engineering
Benders Decomposition for the TwoStage Security Constrained Robust Unit Commitment Problem
Ruiwei Jiang, Muhong Zhang, Guang Li, Yongpei Guan
Convex and Nonsmooth Optimization
{Manifold Identification in Dual Averaging for Regularized Stochastic Online Learning
Sangkyun Lee, Stephen Wright
Combinatorial Optimization
Complexity results for the gap inequalities for the maxcut problem
Laura Galli, Konstantinos Kaparis, Adam N. Letchford
Nonlinear Optimization
Two new weak constraint qualifications and applications
Roberto Andreani, Gabriel Haeser, María Laura Schuverdt, Paulo J. S. Silva
Other Topics
Sharing Isn't Easy: On Strategyproof Mechanisms for Sharing the Costs of Linear Programs
Nelson A. Uhan
Combinatorial Optimization
Branch and cut algorithms for detecting critical nodes in undirected graphs
Marco Di Summa, Andrea Grosso, Marco Locatelli
Nonlinear Optimization
Convergence of the restricted NelderMead algorithm in two dimensions
Jeffrey Lagarias, Bjorn Poonen, Margaret Wright
Integer Programming
Algorithimic and Complexity Results for Cutting Planes Derived from Maximal LatticeFree Convex Sets
Amitabh Basu, Robert Hildebrand, Matthias Koeppe
Applications — OR and Management Sciences
A Moment Approach to Pricing Exotic Options Under RegimeSwitching
Jonathan Li, Roy Kwon
Convex and Nonsmooth Optimization
A quadratically convergent Newton method for vector optimization
L. M. Grana Drummond, F. M. P. Raupp, B. F. Svaiter
Combinatorial Optimization
Removing critical nodes from a graph: complexity results and polynomial algorithms for the case of bounded treewidth
Bernardetta Addis, Marco Di Summa, Andrea Grosso
Applications — OR and Management Sciences
Preferences for Travel Time under Risk and Ambiguity: Implications in Path Selection and Network Equilibrium
Jin Qi, Melvyn Sim, Defeng Sun, XiaoMing Yuan
Stochastic Programming
Probabilistic Set Covering with Correlations
Shabbir Ahmed, Dimitri Papageorgiou
Linear, Cone and Semidefinite Programming
Lower bounds for the number of solutions generated by the simplex method
Tomonari Kitahara, Shinji Mizuno
