Related papers: Best approximation in max-plus semimodules
An efficient proximal-gradient-based method, called proximal extrapolated gradient method, is designed for solving monotone variational inequality in Hilbert space. The proposed method extends the acceptable range of parameters to obtain…
Under investigation is the problem of finding the best approximation of a function in a Hilbert space subject to convex constraints and prescribed nonlinear transformations. We show that in many instances these prescriptions can be…
We propose and discuss a new computational method for the numerical approximation of reachable sets for nonlinear control systems. It is based on the support vector machine algorithm and represents the set approximation as a sublevel set of…
This paper provides a new way of developing the splitting method which is used to solve the problem of finding the resolvent of the sum of maximal monotone operators in Hilbert spaces. By employing accelerated techniques developed by Davis…
We develop a globalized Proximal Newton method for composite and possibly non-convex minimization problems in Hilbert spaces. Additionally, we impose less restrictive assumptions on the composite objective functional considering…
This note is devoted to the study of the links between the Hilbert function of a subscheme X of the projective space, and its geometric properties. We will assume that X is arithmetically Cohen-Macaulay, which allows us to characterize its…
We establish linear convergence rates for a certain class of extrapolated fixed point algorithms which are based on dynamic string-averaging methods in a real Hilbert space. This applies, in particular, to the extrapolated simultaneous and…
We outline a new approach for solving optimization problems which enforce triangle inequalities on output variables. We refer to this as metric-constrained optimization, and give several examples where problems of this form arise in machine…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
New algorithm for finding longest increasing subsequence is discussed. This algorithm is based on the ideas of idempotent mathematics and uses Max-Plus idempotent semiring. Problem of finding longest increasing sub- sequence is reformulated…
We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existence and uniqueness result for an optimal algorithm for…
We consider discrete best approximation problems in the setting of tropical algebra, which is concerned with the theory and application of algebraic systems with idempotent operations. Given a set of input--output pairs of an unknown…
In this paper, we analyze the convergence %semi-convergence properties of projected non-stationary block iterative methods (P-BIM) aiming to find a constrained solution to large linear, usually both noisy and ill-conditioned, systems of…
We derive, similar to Lau and Riha, a matrix formulation of a general best approximation theorem of Singer for the special case of spectral approximations of a given matrix from a given subspace. Using our matrix formulation we describe the…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
In this paper, we present a Douglas-Rachford splitting algorithm within a Hilbert space framework that yields a projected solution for a quasi-variational inequality. This is achieved under the conditions that the operator associated with…
In this paper we propose a linear scalarization proximal point algorithm for solving arbitrary lower semicontinuous quasiconvex multiobjective minimization problems. Under some natural assumptions and using the condition that the proximal…
We compute the dimension of the Hilbert scheme of subvarieties of positive dimension in projective space which are cut by maximal minors of a matrix with polynomial entries.
A class of smoothing methods is proposed for solving mathematical programs with equimibrium constraints. We introduce new and very simple regularizations of the complementarity constraints. Some estimate distance to optimal solution and…
Seeking tighter relaxations of combinatorial optimization problems, semidefinite programming is a generalization of linear programming that offers better bounds and is still polynomially solvable. Yet, in practice, a semidefinite program is…