All Areas Submissions - May 2006

Convex and Nonsmooth Optimization
Discrete gradient method: a derivative free method for nonsmooth optimization
Adil Bagirov, Bulent Karasozen, Meral Sezer

Nonlinear Optimization
Coordinate and Subspace Optimization Methods for Linear Least Squares with Non-Quadratic Regularization
Michael Elad, Boaz Matalon, Michael Zibulevsky

Stochastic Programming
Totally Unimodular Stochastic Programs
Nan Kong, Andrew Schaefer, Shabbir Ahmed

Applications — Science and Engineering
Detecting relevant variables and interactions for classification in Support Vector Machines
Emilio Carrizosa, Belen Martin-Barragan, Dolores Romero Morales

Convex and Nonsmooth Optimization
Steepest descent method for quasiconvex minimization on Riemannian manifolds
Erik Papa Quiroz, E. M. Quispe, P. Roberto Oliveira

Applications — Science and Engineering
Multi-group Support Vector Machines with measurement costs: a biobjective approach
Emilio Carrizosa, Belen Martin-Barragan, Dolores Romero Morales

Nonlinear Optimization
Exploiting Equalities in Polynomial Programming
Vera Juan, Pena Javier, Luis Zuluaga

Linear, Cone and Semidefinite Programming
Implementation of Warm-Start Strategies in Interior-Point Methods for Linear Programming in Fixed Dimension
Elizabeth John, E. Alper Yildirim

Nonlinear Optimization
Recognizing Underlying Sparsity in Optimization
Sunyoung Kim, Masakazu Kojima, Philippe Toint

Robust Optimization
Robust and Data-Driven Optimization: Modern Decision-Making Under Uncertainty
Dimitris Bertsimas, Aurelie Thiele

Linear, Cone and Semidefinite Programming
Target following algorithms for semidefinite programming
Chek Beng Chua

Convex and Nonsmooth Optimization
Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
Yair Censor, Avi Motova, Alexander Segal

Integer Programming
New Inequalities for Finite and Infinite Group Problems from Approximate Lifting
Lisa A. Miller, Yanjun Li, Jean-Philippe P. Richard

Linear, Cone and Semidefinite Programming
Robust Semidefinite Programming Approaches for Sensor Network Localization with Anchors
Nathan Krislock, Veronica Piccialli, Henry Wolkowicz

Linear, Cone and Semidefinite Programming
An Efficient Approach to Updating Simplex Multipliers in the Simplex Algorithm
Jian-Feng Hu, Ping-Qi Pan

Linear, Cone and Semidefinite Programming
Globally Optimal Solutions for Large Single-Row Facility Layout Problems
Miguel F. Anjos, Anthony Vannelli

Applications — OR and Management Sciences
Parallel machine scheduling problem with earliness-tardiness penalties and restrictive common due date: exponential neighborhood search
Y.A. Rios Solis, F. Sourd

Linear, Cone and Semidefinite Programming
An inexact primal-dual path following algorithm for convex quadratic SDP
Kim-Chuan Toh

Combinatorial Optimization
Improved bounds for the symmetric rendezvous search problem on the line
Q. Han, D. Du, J. C. Vera, L. F. Zuluaga

Stochastic Programming
Valid Inequalities and Restrictions for Stochastic Programming Problems with First Order Stochastic Dominance Constraints
Nilay Noyan, Andrzej Ruszczynski

Robust Optimization
Goal Driven Optimization
Melvyn Sim, Wenqing Chen

Combinatorial Optimization
Copositive programming motivated bounds on the stability and the chromatic number
Igor Dukanovic, Franz Rendl

Integer Programming
Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation
Eduardo Uchoa, Ricardo Fukasawa, Jens Lysgaard, Artur Pessoa, Marcus Poggi de Aragão, Diogo Andrade