All Stories

  1. Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
  2. Numerical Optimization of Eigenvalues of Hermitian Matrix Functions
  3. Rounding on the standard simplex: regular grids for global optimization
  4. Joint gateway selection, transmission slot assignment, routing and power control for wireless mesh networks
  5. A hierarchical solution approach for a multicommodity distribution problem under a special cost structure
  6. On the accuracy of uniform polyhedral approximations of the copositive cone
  7. Support vector classification
  8. A simpler characterization of a spectral lower bound on the clique number
  9. An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem
  10. Two Algorithms for the Minimum Enclosing Ball Problem
  11. Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
  12. Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
  13. On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
  14. On the Minimum Volume Covering Ellipsoid of Ellipsoids
  15. On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function
  16. Minimum-Volume Enclosing Ellipsoids and Core Sets
  17. Approximate minimum enclosing balls in high dimensions using core-sets
  18. Warm-Start Strategies in Interior-Point Methods for Linear Programming
  19. An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs
  20. Sensitivity analysis in linear programming and semidefinite programming using interior-point methods