|
Optimization Online Digest — June 2002
Applications — Science and Engineering
Model Problems for the Multigrid Optimization of Systems Governed by Differential Equations
R.M. Lewis, S.G. Nash
Combinatorial Optimization
Fractional Packing of T-joins
Francisco Barahona
Randomized heuristics for the MAX-CUT problem
P. Festa, P. M. Pardalos, M. G. C. Resende, C. C. Ribeiro
Two-connected networks with rings of bounded cardinality
Bernard Fortz, Martine Labbé
Convex and Nonsmooth Optimization
A new exact penalty function
Waltraud Huyer, Arnold Neumaier
Global Optimization
Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones clusters
Marco Locatelli, Fabio Schoen
Integer Programming
Safe bounds in linear and mixed-integer programming
Arnold Neumaier, Oleg Shcherbina
Linear, Cone and Semidefinite Programming
A General Framework for Convex Relaxation of Polynomial Optimization Problems over Cones
Masakazu Kojima, Sunyoung Kim, Hayato Waki
Characterization of the limit point of the central path in semidefinite programming
Göran Sporre, Anders Forgren
Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
Van Anh Truong, Levent Tuncel
Limiting behavior of the central path in semidefinite optimization
M. Halicka, E. De Klerk, C. Roos
An Improved Semidefinite Programming Relaxation for the Satisfiability Problem
Miguel F. Anjos
|