We propose a method of conditional minimization of convex functions from the class of cutting methods. The method based on using of the exterior penalty functions. The iteration points are found by ...

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 ...

Matrix Inequalities and Convex Functions Publication Trend The graph below shows the total number of publications each year in Matrix Inequalities and Convex Functions.

Let f (x) be a real-valued, convex function defined on a convex set X (for example, ). For simplicity of exposition, we assume that f is a well-behaved (differentiable) function. Consider the graph of ...

Modern convex optimization-based graph algorithms. Convex optimization presents an exciting new direction in designing exact and approximate graph algorithms. However, these algorithms are often ...

We present a novel method to generate high-quality simplicial meshes with specified anisotropy. Given a surface or volumetric domain equipped with a Riemannian metric that encodes the desired ...

A multi-threaded library for the manipulation of directed graphs. It allows to perform queries and modifications such as reachability, partitioning, convex partitioning and coarsening via multiple ...