Results 81 to 90 of about 330,664 (214)

Distributed Optimization of Convex Sum of Non-Convex Functions [PDF]

open access: yesarXiv, 2016
We present a distributed solution to optimizing a convex function composed of several non-convex functions. Each non-convex function is privately stored with an agent while the agents communicate with neighbors to form a network. We show that coupled consensus and projected gradient descent algorithm proposed in [1] can optimize convex sum of non ...
arxiv  

Abstract convex optimal antiderivatives

open access: yesAnnales de l'Institut Henri Poincaré C, Analyse non linéaire, 2012
Having studied families of antiderivatives and their envelopes in the setting of classical convex analysis, we now extend and apply these notions and results in settings of abstract convex analysis. Given partial data regarding a c -subdifferential, we consider the set of all c -convex
Simeon Reich, Sedi Bartz
openaire   +3 more sources

A Note on Nesterov's Accelerated Method in Nonconvex Optimization: a Weak Estimate Sequence Approach [PDF]

open access: yesarXiv, 2020
We present a variant of accelerated gradient descent algorithms, adapted from Nesterov's optimal first-order methods, for weakly-quasi-convex and weakly-quasi-strongly-convex functions. We show that by tweaking the so-called estimate sequence method, the derived algorithm achieves optimal convergence rate for weakly-quasi-convex and weakly-quasi ...
arxiv  

Lower Bounds for Higher-Order Convex Optimization [PDF]

open access: yesarXiv, 2017
State-of-the-art methods in convex and non-convex optimization employ higher-order derivative information, either implicitly or explicitly. We explore the limitations of higher-order optimization and prove that even for convex optimization, a polynomial dependence on the approximation guarantee and higher-order smoothness parameters is necessary.
arxiv  

Video semantics-driven resource allocation algorithm in Internet of vehicles

open access: yesTongxin xuebao, 2021
Aiming at the problem that traditional resource allocation methods will no longer be applicable, with the demand of intelligent computing services such as video semantic understanding in Internet of vehicles, the video semantic driven resource allocation
Jiujiu CHEN   +5 more
doaj  

Geodesic Convex Optimization: Differentiation on Manifolds, Geodesics, and Convexity [PDF]

open access: yesarXiv, 2018
Convex optimization is a vibrant and successful area due to the existence of a variety of efficient algorithms that leverage the rich structure provided by convexity. Convexity of a smooth set or a function in a Euclidean space is defined by how it interacts with the standard differential structure in this space -- the Hessian of a convex function has ...
arxiv  

Optimal Morphs of Convex Drawings

open access: yes, 2015
We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear complexity. The linear bound is asymptotically optimal in the worst case.
Angelini, Patrizio   +5 more
openaire   +6 more sources

Home - About - Disclaimer - Privacy