Zobrazeno 1 - 10
of 197
pro vyhledávání: '"Vandenberghe, Lieven"'
Autor:
Tunçel, Levent, Vandenberghe, Lieven
A convex cone is homogeneous if its automorphism group acts transitively on the interior of the cone, i.e., for every pair of points in the interior of the cone, there exists a cone automorphism that maps one point to the other. Cones that are homoge
Externí odkaz:
http://arxiv.org/abs/2211.00761
Autor:
Jiang, Xin, Vandenberghe, Lieven
Publikováno v:
Journal of Optimization Theory and Applications 196, 936-972 (2023)
The paper presents primal-dual proximal splitting methods for convex optimization, in which generalized Bregman distances are used to define the primal and dual proximal update steps. The methods extend the primal and dual Condat-Vu algorithms and th
Externí odkaz:
http://arxiv.org/abs/2203.00252
Autor:
Farsad, Nariman, Chuang, Will, Goldsmith, Andrea, Komninakis, Christos, Médard, Muriel, Rose, Christopher, Vandenberghe, Lieven, Wesel, Emily E., Wesel, Richard D.
This work introduces the particle-intensity channel (PIC) as a model for molecular communication systems and characterizes the capacity limits as well as properties of the optimal (capacity-achieving) input distributions for such channels. In the PIC
Externí odkaz:
http://arxiv.org/abs/2005.10682
The purpose of this work is to develop and study a distributed strategy for Pareto optimization of an aggregate cost consisting of regularized risks. Each risk is modeled as the expectation of some loss function with unknown probability distribution
Externí odkaz:
http://arxiv.org/abs/1909.09417
T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method
We consider T-optimal experiment design problems for discriminating multi-factor polynomial regression models where the design space is defined by polynomial inequalities and the regression parameters are constrained to given convex sets. Our propose
Externí odkaz:
http://arxiv.org/abs/1807.08213
Autor:
Moursi, Walaa M., Vandenberghe, Lieven
The Douglas-Rachford method is a popular splitting technique for finding a zero of the sum of two subdifferential operators of proper closed convex functions; more generally two maximally monotone operators. Recent results concerned with linear rates
Externí odkaz:
http://arxiv.org/abs/1805.09396
We study a network utility maximization (NUM) decomposition in which the set of flow rates is grouped by source-destination pairs. We develop theorems for both single-path and multipath cases, which relate an arbitrary NUM problem involving all flow
Externí odkaz:
http://arxiv.org/abs/1703.00525
Autor:
Chao, Hsiao-Han, Vandenberghe, Lieven
This paper presents generalizations of semidefinite programming formulations of 1-norm optimization problems over infinite dictionaries of vectors of complex exponentials, which were recently proposed for superresolution, gridless compressed sensing,
Externí odkaz:
http://arxiv.org/abs/1604.02500
We propose a new method for generating semidefinite relaxations of optimal power flow problems. The method is based on chordal conversion techniques: by dropping some equality constraints in the conversion, we obtain semidefinite relaxations that are
Externí odkaz:
http://arxiv.org/abs/1308.6718