Zobrazeno 1 - 10
of 816
pro vyhledávání: '"Ugon, A."'
Autor:
Millán, Reinier Díaz, Ugon, Julien
In this paper we introduce two conceptual algorithms for minimising abstract convex functions. Both algorithms rely on solving a proximal-type subproblem with an abstract Bregman distance based proximal term. We prove their convergence when the set o
Externí odkaz:
http://arxiv.org/abs/2402.04281
The variational inequality problem in finite-dimensional Euclidean space is addressed in this paper, and two inexact variants of the extragradient method are proposed to solve it. Instead of computing exact projections on the constraint set, as in pr
Externí odkaz:
http://arxiv.org/abs/2309.00648
In the present paper, we formulate two versions of Frank--Wolfe algorithm or conditional gradient method to solve the DC optimization problem with an adaptive step size. The DC objective function consists of two components; the first is thought to be
Externí odkaz:
http://arxiv.org/abs/2308.16444
Rational and neural network based approximations are efficient tools in modern approximation. These approaches are able to produce accurate approximations to nonsmooth and non-Lipschitz functions, including multivariate domain functions. In this pape
Externí odkaz:
http://arxiv.org/abs/2303.04436
Publikováno v:
European J. Combin., 113:103752, 2023
We show that the graph of a simplicial polytope of dimension $d \ge 3$ has no nontrivial minimum edge cut with fewer than $d(d+1)/2$ edges, hence the graph is $\min\{\delta, d(d+1)/2\}$-edge-connected where $\delta$ denotes the minimum degree. When $
Externí odkaz:
http://arxiv.org/abs/2209.07792
There are many methods to find a maximum (or maximal) clique in large networks. Due to the nature of combinatorics, computation becomes exponentially expensive as the number of vertices in a graph increases. Thus, there is a need for efficient algori
Externí odkaz:
http://arxiv.org/abs/2207.13010
Cycles have many interesting properties and are widely studied in many disciplines. In some areas, maximising the counts of $k$-cycles are of particular interest. A natural candidate for the construction method used to maximise the number of subgraph
Externí odkaz:
http://arxiv.org/abs/2207.13007
Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to study the
Externí odkaz:
http://arxiv.org/abs/2206.02565
The theory of abstract convexity, also known as convexity without linearity, is an extension of the classical convex analysis. There are a number of remarkable results, mostly concerning duality, and some numerical methods, however, this area has not
Externí odkaz:
http://arxiv.org/abs/2202.09959
In the area of extremal graph theory, there exists a problem that investigates the maximum induced density of a $k$-vertex graph $H$ in any $n$-vertex graph $G$. This is known as the problem of \emph{inducibility} that was first introduced by Pippeng
Externí odkaz:
http://arxiv.org/abs/2202.00411