Specifically, we consider such additional information in the form of a collection of knowingly corresponding functions (seeds) or vector-valued vertex attributes, and show a constructive spectral ...

The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph ...

A well known theorem [3] in the theory of ordinary convex functions states that: ... 2.1. A function is said to be trigonometrically ρ-convex if for any arbitrary closed subinterval of such that , the ...

Discover the proof that the average function of a trigonometrically ρ-convex function is also trigonometrically ρ-convex. ... 2.1. A function is said to be trigonometrically ρ-convex if for any ...

The method of nonlinear conjugate gradients (NCG) is widely used in practice for unconstrained optimization, but it satisfies weak complexity bounds at best when applied to smooth convex functions. In ...

Convex Function: A function defined on an interval or convex set such that the line segment between any two points on its graph lies above or on the graph, a property that is crucial for deriving ...