Results 71 to 80 of about 4,731,628 (237)
A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization [PDF]
, 2023 Céline Moucer +2 more
openalex +1 more source
IEEE Transactions on Circuits and Systems - II - Express Briefs, 2019 A distributed convex optimization problem over a weight-unbalanced directed network is studied in this brief, where the global objective function is equal to the sum of strongly convex objective functions with globally Lipschitz gradients.
Yanan Zhu, Wenwu Yu, G. Wen, W. Ren
semanticscholar +1 more source
First-Order Methods for Convex Optimization
EURO Journal on Computational Optimization, 2021 First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various
Pavel Dvurechensky +2 more
doaj +1 more source
Memory-Efficient Convex Optimization for Self-Dictionary Separable Nonnegative Matrix Factorization: A Frank–Wolfe Approach [PDF]
, 2022 Tri Nguyen, Xiao Fu, Ruiyuan Wu
openalex +1 more source
Optimal divisions of a convex body
Mathematical Inequalities & Applications, 2023 For a convex body $C$ in $\mathbb{R}^d$ and a division of $C$ into convex subsets $C_1,\ldots,C_n$, we can consider $max\{F(C_1),\ldots, F(C_n)\}$ (respectively, $min\{F(C_1),\ldots, F(C_n)\}$), where $F$ represents one of these classical geometric magnitudes: the diameter, the minimal width, or the inradius.
Cañete Martín, Antonio Jesús +2 more
openaire +4 more sources
Multimodularity, Convexity, and Optimization Properties [PDF]
Mathematics of Operations Research, 2000 In this paper we investigate the properties of multimodular functions. In doing so we give elementary proofs for properties already established by Hajek and we generalize some of his results. In particular, we extend the relation between convexity and multimodularity to some convex subsets of ℤm. We also obtain general optimization results for average
Altman, Eitan +2 more
openaire +3 more sources
Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints
IEEE Transactions on Automatic Control, 2019 The distributed convex optimization problem is studied in this paper for any fixed and connected network with general constraints. To solve such an optimization problem, a new type of continuous-time distributed subgradient optimization algorithm is ...
Yanan Zhu +4 more
semanticscholar +1 more source
Optimal Resource Allocation for Two-User and Single-DF-Relay Network With Ambient Backscatter
IEEE Access, 2019 In this paper, we investigate and analyze a two-user single decode-and-forward (DF) relay network with ambient backscatter communication capabilities, where the user nodes and the relay node are equipped with a wireless-powered device instead of embedded
Chuangming Zheng +2 more
doaj +1 more source
ON OPTIMUM DESIGN OF FRAME STRUCTURES
Acta Polytechnica CTU Proceedings, 2020 Optimization of frame structures is formulated as a non-convex optimization problem, which is currently solved to local optimality. In this contribution, we investigate four optimization approaches: (i) general non-linear optimization, (ii) optimality ...
Marek Tyburec +3 more
doaj +1 more source
Distributed constrained optimization via continuous-time mirror design
Advances in Difference Equations, 2018 Recently, distributed convex optimization using a multiagent system has received much attention by many researchers. This problem is frequently approached by combing the consensus algorithms in the multiagent literature and the gradient algorithms in the
Rui Sheng, Wei Ni
doaj +1 more source