Convex Optimization inR
نویسندگان
چکیده
منابع مشابه
Convex Optimization
In this paper we propose an alternative solution to rl-blodr 1' problems. This altemativeis based upon the idea of transforming the I' problem into an equivalent (in the sense of having the same solution) mixed ll/'Hm problem that can be solved using convex optimieation techniques. The proposed algorithm has the advantage of generating, at each step, an upper bound of the cost that converges un...
متن کاملBeyond Convex Optimization: Star-Convex Functions
We introduce a polynomial time algorithm for optimizing the class of star-convex functions, under no Lipschitz or other smoothness assumptions whatsoever, and no restrictions except exponential boundedness on a region about the origin, and Lebesgue measurability. The algorithm’s performance is polynomial in the requested number of digits of accuracy and the dimension of the search domain. This ...
متن کامل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...
متن کاملOn convex optimization without convex representation
We consider the convex optimization problem P : minx{f(x) : x ∈ K} where f is convex continuously differentiable, and K ⊂ R is a compact convex set with representation {x ∈ R : gj(x) ≥ 0, j = 1, . . . ,m} for some continuously differentiable functions (gj). We discuss the case where the gj ’s are not all concave (in contrast with convex programming where they all are). In particular, even if th...
متن کاملConvex programming for disjunctive convex optimization
Given a nite number of closed convex sets whose algebraic representation is known, we study the problem of optimizing a convex function over the closure of the convex hull of the union of these sets. We derive an algebraic characterization of the feasible region in a higher-dimensional space and propose a solution procedure akin to the interior-point approach for convex programming.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Software
سال: 2014
ISSN: 1548-7660
DOI: 10.18637/jss.v060.i05