Sciweavers

MP
2006
97views more  MP 2006»
14 years 12 days ago
Subdifferential representations of risk measures
Measures of risk appear in two categories: Risk capital measures serve to determine the necessary amount of risk capital in order to avoid ruin if the outcomes of an economic acti...
Georg Ch. Pflug
MP
2006
81views more  MP 2006»
14 years 12 days ago
Almost all webs are not rank-perfect
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
Arnaud Pêcher, Annegret Wagler
MP
2006
107views more  MP 2006»
14 years 12 days ago
Optimality conditions in portfolio analysis with general deviation measures
Optimality conditions are derived for problems of minimizing a general measure of deviation of a random variable, with special attention to situations where the random variable cou...
R. Tyrrell Rockafellar, Stan Uryasev, Michael Zaba...
MP
2006
110views more  MP 2006»
14 years 12 days ago
Decomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
Ted K. Ralphs, Matthew V. Galati
MP
2006
80views more  MP 2006»
14 years 12 days ago
Minimizing Polynomials via Sum of Squares over the Gradient Ideal
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...
Jiawang Nie, James Demmel, Bernd Sturmfels
MP
2006
134views more  MP 2006»
14 years 12 days ago
Cubic regularization of Newton method and its global performance
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
Yurii Nesterov, Boris T. Polyak
MP
2006
123views more  MP 2006»
14 years 12 days ago
New interval methods for constrained global optimization
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
Mihály Csaba Markót, J. Ferná...
MP
2006
113views more  MP 2006»
14 years 12 days ago
On the gap between the quadratic integer programming problem and its semidefinite relaxation
Consider the semidefinite relaxation (SDR) of the quadratic integer program (QIP): := maxx{-1,1}n xT Qx minD-Q 0 trace(D) =:
U. Malik, Imad M. Jaimoukha, G. D. Halikias, S. K....
MP
2006
79views more  MP 2006»
14 years 12 days ago
Projection results for vehicle routing
A variety of integer programming formulations have been proposed for Vehicle Routing Problems (VRPs), including the so-called two- and three-index formulations, the set partitioni...
Adam N. Letchford, Juan José Salazar Gonz&a...