All Areas Submissions - October 2004
Applications — OR and Management Sciences
A Piecewise Linearization Framework for Retail Shelf Space Management Models
Jens Irion, Faiz Al-Khayyal, J-C Lu
Nonlinear Optimization
S-lemma: a survey
Imre Pólik, Tamás Terlaky
Convex and Nonsmooth Optimization
Classical Simplex Methods for Linear Programming and Their Developments
Yan Zizong, Fei Pusheng, Wang Xiaoli
Applications — Science and Engineering
Optimal distance separating halfspace
Frank Plastria, Emilio Carrizosa
Applications — Science and Engineering
Optimal expected-distance separating halfspace
Emilio Carrizosa, Frank Plastria
Linear, Cone and Semidefinite Programming
A New Complexity Result on Solving the Markov Decision Problem
Yinyu Ye
Convex and Nonsmooth Optimization
A New Conjugate Gradient Algorithm Incorporating Adaptive Ellipsoid Preconditioning
Renato D.C. Monteiro, Jerome W. O'Neal, Arkadi Nemirovski
Other Topics
An Improved Algorithm for Biobjective Integer Programs
T.K. Ralphs, M.J. Saltzman, M.M. Wiecek
Linear, Cone and Semidefinite Programming
A Stable Iterative Method for Linear Programming
Maria Gonzalez-Lima, Hua Wei, Henry Wolkowicz
Combinatorial Optimization
A test problem of circles packing with best known optimum solution
Teng Hong-fei, Che Chao, Chen Yu, Wang Yi-shou
Linear, Cone and Semidefinite Programming
On the Behavior of the Homogeneous Self-Dual Model for Conic Convex Optimization
Robert M. Freund
Stochastic Programming
On complexity of stochastic programming problems
Alexander Shapiro, Arkadi Nemirovski
Linear, Cone and Semidefinite Programming
The Q Method for Second-order Cone Programming
Farid Alizadeh, Yu Xia
Linear, Cone and Semidefinite Programming
A Note on 2-dimensional Second-order Cone Programming and Its Simplex Method
Farid Alizadeh, Yu Xia
Linear, Cone and Semidefinite Programming
An Algorithm for Perturbed Second-order Cone Programs
Yu Xia
Linear, Cone and Semidefinite Programming
The Q Method for Symmetric Cone Programming
Farid Alizadeh, Yu Xia
Nonlinear Optimization
On the Convergence of Successive Linear-Quadratic Programming Algorithms
Richard H. Byrd, Nicholas I. M. Gould, Jorge Nocedal, Richard A. Waltz
Global Optimization
Jordan-algebraic aspects of nonconvex optimization over symmetric cones
Leonid Faybusovich, Ye Lu
Convex and Nonsmooth Optimization
Best approximation to common fixed points of a semigroup of nonexpansive operators
Arkady Aleyner, Yair Censor
Convex and Nonsmooth Optimization
Proximal-ACCPM: a versatile oracle based optimization method
F. Babonneau, C. Beltran, A. Haurie, C. Tadonki, J.-P. Vial
Applications — OR and Management Sciences
Lower bounds for the earliness-tardiness scheduling problem on single and parallel machines
Safia Kedad-Sidhoum, Yasmin Rios Solis, Francis Sourd
Linear, Cone and Semidefinite Programming
Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity
Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu
Applications — OR and Management Sciences
A genetic algorithm for the resource constrained multi-project scheduling problem
José F. Gonçalves, Jorge J.M. Mendes, Mauricio G.C. Resende
|