All Areas Submissions - April 2006

Integer Programming
Extreme inequalities for infinite group problems
Santanu S. Dey, Jean-Philippe P. Richard, Lisa A. Miller, Yanjun Li

Complementarity and Variational Inequalities
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Florian A. Potra

Linear, Cone and Semidefinite Programming
Constructing self-concordant barriers for convex cones
Yurii Nesterov

Applications — Science and Engineering
A Column Generation Approach for Support Vector Machines
Belen Martin-Barragan, Emilio Carrizosa, Dolores Romero Morales

Combinatorial Optimization
Approximate resolution of a resource-constrained scheduling problem
Renaud Sirdey, Jacques Carlier, Dritan Nace

Complementarity and Variational Inequalities
Corrector-predictor methods for sufficient linear complementarity problems in a wide neighborhood of the central path
Xing Liu, Florian Potra

Complementarity and Variational Inequalities
Erratum: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with $O(\sqrt{n}L)$-iteration complexity
Florian A. Potra

Complementarity and Variational Inequalities
Erratum: Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path,
Florian A. Potra, Xing Liu

Combinatorial Optimization
A branch-and-cut algorithm for a resource-constrained scheduling problem
Renaud Sirdey, Hervé L. M. Kerivin

Linear, Cone and Semidefinite Programming
Nonsymmetric potential-reduction methods for general cones
Yurii Nesterov

Global Optimization
Convergent SDP-relaxations in polynomial optimization with sparsity
Jean B. Lasserre

Nonlinear Optimization
Cubic regularization of Newton's method for convex problems with constraints
Yurii Nesterov

Robust Optimization
Polyhedral aspects of a robust knapsack problem
Olivier Klopfenstein, Dritan Nace

Stochastic Programming
On Rates of Convergence for Stochastic Optimization Problems Under Non-I.I.D. Sampling
Tito Homem-de-Mello

Convex and Nonsmooth Optimization
A Proximal Method for Identifying Active Manifolds
W. L. Hare

Global Optimization
An improved algorithm for computing Steiner minimal trees in Euclidean d-space
M. Fampa, K.M. Anstreicher

Applications — OR and Management Sciences
A Lagrangian Heuristic for Satellite Range Scheduling with Resource Constraints
Fabrizio Marinelli, Salvatore Nocella, Fabrizio Rossi, Stefano Smriglio

Nonlinear Optimization
Primal-dual interior point methods for PDE-constrained optimization
Michael Ulbrich, Stefan Ulbrich

Convex and Nonsmooth Optimization
Mosco stability of proximal mappings in reflexive Banach spaces
Dan Butnariu, Elena Resmerita

Convex and Nonsmooth Optimization
Proximal Point Methods for Quasiconvex and Convex Functions With Bregman Distances
Erik Alex Papa Quiroz, Paulo Roberto Oliveira

Nonlinear Optimization
Using Partial Separability of Functions in Generating Set Search Methods for Unconstrained Optimisation
Lennart Frimannslund, Trond Steihaug

Global Optimization
Optimization of univariate functions on bounded intervals by interpolation and semidefinite programming
Etienne De Klerk, Gamal Elabwabi, Dick Den Hertog

Applications — OR and Management Sciences
Lot sizing with inventory gains
Hamish Waterer

Applications — Science and Engineering
New Korkin-Zolotarev Inequalities
R. A. Pendavingh, S. H. M. van Zwam

Applications — OR and Management Sciences
Some remarks about the transformation of Charnes and Cooper
Ezio Marchi