• Aucun résultat trouvé

An Algorithm for Computing the Symmetry Point of a Polytope

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "An Algorithm for Computing the Symmetry Point of a Polytope"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

An Algorithm for Computing the Symmetry Point

of a Polytope

Alexandre Belloni* and Robert M. Freund**

*MIT Operations Research Center

**MIT Sloan School of Management

Abstract—Given a closed convex set C and a point x in C, let

sym(x,C) denote the symmetry value of x in C, which essentially measures how symmetric C is about the point x. Denote by sym(C) the largest value of sym(x,C) among all x in C, and let x* denote the most symmetric point in C. These symmetry measures are all invariant under linear transformation, change in inner product, etc., and so are of interest in the study of the geometry of convex sets and arise naturally in the evaluation of the complexity of interior-point methods in particular. Herein we show that when C is given by the intersection of halfspaces, i.e., C={x | Ax <= b}, then x* as well as the symmetry value of C can be computed by using linear programming. Furthermore, given an approximate analytic center of C, there is a strongly polynomial-time algorithm for approximating sym(C) to any given relative tolerance.

Références

Télécharger maintenant ( PDF - 1 Page - 10.84 KB )

Documents relatifs

Geometry of expanding absolutely continuous invariant measures and the liftability problem

We show that for a large class of maps on manifolds of arbitrary finite dimension, the existence of a Gibbs–Markov–Young structure (with Lebesgue as the reference measure) is

Representation-theoretic proof of the inner product and symmetry identities for Macdonald's polynomials

In Section 2 we define Macdonald’s polynomials PA and recall the construc- tion of PA and the inner product between them for the root system An- in terms.. of

The analysis of symmetry and asymmetry : orthogonality of decomposition of symmetry into quasi-symmetry and marginal symmetry for multi-way tables

Other models which describe the structures of various asymmetry instead of symmetry are given; for example, the conditional symmetry model (McCullagh, 1978), the

These atoms are identified with the extreme points and elements of the extreme rays of the regularizer level sets

In this paper we have developed representer theorems for convex regularized inverse problems (1.1), based on fundamental properties of the geometry of convex sets: the solution set

WHICH SETS ARE SETS OF LENGTHS IN ALL NUMERICAL MONOIDS ?

Thus this class contains all commutative Krull monoids (in particular, the multiplicative monoids of principal orders in number fields) but also wide classes of non-commutative..

Geometry of the Limit Sets of Linear Switched Systems

Keywords: Switched systems; Asymptotic stability; Quadratic Lya- punov functions; Chaotic signals; Omega-limit sets.. AMS Subject Classification:

Distances sets that are a shift of the integers and Fourier basis for planar convex sets

As a corollary, we obtain the result from [IKP01] and [IKT01] that if K is a centrally symmetric convex body with a smooth boundary and non-vanishing curvature, then L 2 (K) does

Geometry of convex measures and links with the Information theory

Keywords: (B)-conjecture, Brunn-Minkowski, Convex geometry, Convex measure, Entropy, Entropy power, Rényi entropy, Gaussian measure, Hamilton-Jacobi equation, Isoperimetry,