All Areas Submissions  January 2011
Linear, Cone and Semidefinite Programming
KleeMinty's LP and Upper Bounds for Dantzig's Simplex Method
Tomonari Kitahara, Shinji Mizuno
Combinatorial Optimization
Four new upper bounds for the stability number of a graph
Miklos Ujvari
Integer Programming
A Computational Study of Finitely Convergent Polyhedral Methods for General MixedInteger Linear Programs
Binyuan Chen, Dinakar Gade, Simge Kucukyavuz, Suvrajeet Sen
Convex and Nonsmooth Optimization
Targetfollowing framework for symmetric cone programming
Chek Beng Chua
Applications — OR and Management Sciences
Approximate Dynamic Programming with Bezier Curves/Surfaces for Toppercentile traffic routing
Xinan Yang, Andreas Grothey
Stochastic Programming
Minimax and risk averse multistage stochastic programming
Alexander Shapiro
Applications — Science and Engineering
Global Stability Analysis of Fluid Flows using SumofSquares
Paul Goulart, Sergei Chernyshenko
Combinatorial Optimization
A parametric active set method for quadratic programs with vanishing constraints
Christian Kirches, Andreas Potschka, Hans Georg Bock, Sebastian Sager
Global Optimization
On the relation between concavity cuts and the surrogate dual for convex maximization problems
Marco Locatelli, Fabio Schoen
Nonlinear Optimization
On the convergence of trust region algorithms for unconstrained minimization without derivatives
MJD Powell
Stochastic Programming
On the economic interpretation of time consistent dynamic stochastic programming problems
Birgit Rudloff, Alexandre Street, Davi Valladão
Nonlinear Optimization
An Iterative algorithm for large size LeastSquares constrained regularization problems.
Elena Loli Piccolomini, Zama Fabiana
Convex and Nonsmooth Optimization
Piecewise quadratic approximations in convex numerical optimization
Annabella Astorino, Antonio Frangioni, Manlio Gaudioso, Enrico Gorgone
Infinite Dimensional Optimization
Multiobjective DC Programming with Infinite Convex Constraints
Shaojian Qu, Mark Goh, Soonyi Wu
Integer Programming
Some Properties of Convex Hulls of Integer Points Contained in General Convex Sets
Santanu S. Dey, Diego A. Moran
Linear, Cone and Semidefinite Programming
A Bound for the Number of Different Basic Solutions Generated by the Simplex Method
Tomonari Kitahara, Shinji Mizuno
Applications — Science and Engineering
The iBP algorithm for the discretizable molecular distance geometry problem with interval data
Carlile Lavor, Leo Liberti, Antonio Mucherino
Linear, Cone and Semidefinite Programming
Epigraphical cones I
Alberto Seeger
Linear, Cone and Semidefinite Programming
Epigraphical cones II
Alberto Seeger
Convex and Nonsmooth Optimization
Error bounds for vectorvalued functions: necessary and sufficient conditions
Ewa Bednarczuk, Alexander Kruger
Applications — OR and Management Sciences
Energy Savings in Wireless Mesh Networks in a TimeVariable Context
Antonio Capone, Filippo Malandra, Brunilde Sansò
Combinatorial Optimization
New Bounds for Restricted Isometry Constants in Lowrank Matrix Recovery
Lingchen Kong, Naihua Xiu
Convex and Nonsmooth Optimization
On Implementing a Homogeneous InteriorPoint Algorithm for Nonsymmetric Conic Optimization
Anders Skajaa, John Bagterp Jørgensen, Per Christian Hansen
Convex and Nonsmooth Optimization
Double Smoothing Technique for Convex Optimization Problems in Hilbert Spaces with Applications to Optimal Control
Olivier Devolder, François Glineur, Yurii Nesterov
Linear, Cone and Semidefinite Programming
New developments in the primaldual column generation technique
Jacek Gondzio, Pablo GonzálezBrevis, Pedro Munari
Robust Optimization
ChanceConstrained Linear Matrix Inequalities with Dependent Perturbations: A Safe Tractable Approximation Approach
SinShuen Cheung, Anthony ManCho So, Kuncheng Wang
Applications — Science and Engineering
Optimizationbased search for Nordsieck methods of high order with quadratic stability
A. Cardone, Z. Jackiewicz, H. D. Mittelmann
Integer Programming
A Probing Algorithm for MINLP with Failure Prediction by SVM
Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, Francois Margot, Andreas Waechter
Convex and Nonsmooth Optimization
Convexity Conditions of Kantorovich Function and Related Semiinfinite Linear Matrix Inequalities
YunBin Zhao
Linear, Cone and Semidefinite Programming
Approximation Theory of Matrix Rank Minimization and Its Application to Quadratic Equations
YunBin Zhao
Integer Programming
CONVEX HULL RELAXATION (CHR) FOR CONVEX AND NONCONVEX MINLP PROBLEMS WITH LINEAR CONSTRAINTS
Aykut Ahlatçıoğlu, Monique Guignard
Integer Programming
A new, solvable, primal relaxation for convex nonlinear integer programming problems
Monique Guignard
Integer Programming
Combining QCR and CHR for Convex Quadratic MINLP Problems with Linear Constraints
Aykut Ahlatçıoğlu, Michael Bussieck, Mustafa Esen, Monique Guignard, Jan Jagla, Alexander Meeraus
Infinite Dimensional Optimization
Decision Rule Approximations for Continuous Linear Programs
Dimitra Bampou, Daniel Kuhn
