Optimization Online Digest — April 2006

Applications — OR and Management Sciences

A Lagrangian Heuristic for Satellite Range Scheduling with Resource Constraints
Fabrizio Marinelli, Salvatore Nocella, Fabrizio Rossi, Stefano Smriglio

Lot sizing with inventory gains
Hamish Waterer

Some remarks about the transformation of Charnes and Cooper
Ezio Marchi

Applications — Science and Engineering

A Column Generation Approach for Support Vector Machines
Belen Martin-Barragan, Emilio Carrizosa, Dolores Romero Morales

New Korkin-Zolotarev Inequalities
R. A. Pendavingh, S. H. M. van Zwam

Combinatorial Optimization

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

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

Complementarity and Variational Inequalities

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

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

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

Convex and Nonsmooth Optimization

A Proximal Method for Identifying Active Manifolds
W. L. Hare

Mosco stability of proximal mappings in reflexive Banach spaces
Dan Butnariu, Elena Resmerita

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

Global Optimization

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

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

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

Linear, Cone and Semidefinite Programming

Constructing self-concordant barriers for convex cones
Yurii Nesterov

Nonsymmetric potential-reduction methods for general cones
Yurii Nesterov

Nonlinear Optimization

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

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

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

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