Zobrazeno 1 - 10
of 971
pro vyhledávání: '"Millan R"'
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
Autor:
Millán, R. Díaz, Roshchina, Vera
Intrinsic core generalises the finite-dimensional notion of the relative interior to arbitrary (real) vector spaces. Our main goal is to provide a self-contained overview of the key results pertaining to the intrinsic core and to elucidate the relati
Externí odkaz:
http://arxiv.org/abs/2107.07730
In this paper, we propose a new algorithm combining the Douglas-Rachford (DR) algorithm and the Frank-Wolfe algorithm, also known as the conditional gradient (CondG) method, for solving the classic convex feasibility problem. Within the algorithm, wh
Externí odkaz:
http://arxiv.org/abs/2105.13005
In this paper we develop an optimisation based approach to multivariate Chebyshev approximation on a finite grid. We consider two models: multivariate polynomial approximation and multivariate generalised rational approximation. In the second case th
Externí odkaz:
http://arxiv.org/abs/2101.11786
The motivation of this paper is the development of an optimisation method for solving optimisation problems appearing in Chebyshev rational and generalised rational approximation problems, where the approximations are constructed as ratios of linear
Externí odkaz:
http://arxiv.org/abs/2011.02721
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The classical convex feasibility problem in a finite dimensional Euclidean space is studied in the present paper. We are interested in two cases. First, we assume to know how to compute an exact project onto one of the sets involved and the other set
Externí odkaz:
http://arxiv.org/abs/1912.04247
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We focus on the convergence analysis of averaged relaxations of cutters, specifically for variants that---depending upon how parameters are chosen---resemble \emph{alternating projections}, the \emph{Douglas--Rachford method}, \emph{relaxed reflect-r
Externí odkaz:
http://arxiv.org/abs/1810.02463