Convex integer optimization by constantly many linear counterparts

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Integer Optimization by Constantly Many Linear Counterparts

Article history: Received 8 November 2012 Accepted 7 January 2014 Available online 23 January 2014 Submitted by R. Brualdi Dedicated to the memory of Uri Rothblum MSC: 52B 52C 62H 68Q 68R 90B 90C

متن کامل

Integer convex minimization by mixed integer linear optimization

Minimizing a convex function over the integral points of a bounded convex set is polynomial in fixed dimension [6]. We provide an alternative, short, and geometrically motivated proof of this result. In particular, we present an oraclepolynomial algorithm based on a mixed integer linear optimization oracle.

متن کامل

Distributed Convex Optimization with Many Convex Constraints

We address the problem of solving convex optimization problems with many convex constraints in a distributed setting. Our approach is based on an extension of the alternating direction method of multipliers (ADMM) that recently gained a lot of attention in the Big Data context. Although it has been invented decades ago, ADMM so far can be applied only to unconstrained problems and problems with...

متن کامل

Integer (Linear) Optimization

An amazing variety of activities and situations can be adequately modeled as linear optimization problems, also known as linear programs (LPs), or convex nonlinear optimization problems. Adequately means that the degree of approximation to reality that such a representation involves is acceptable. However, as the world that we inhabit is neither linear nor convex, the most common obstacle to th...

متن کامل

Polyhedral approximation in mixed-integer convex optimization

Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2014

ISSN: 0024-3795

DOI: 10.1016/j.laa.2014.01.007