we present a modified version of the infeasible-interior- we present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by mansouri et al. (nonlinear anal. real world appl. 12(2011) 545--561). each main step of the algorithm consists of a feasibility step and several centering steps. we use a different feasibility step, which targ...

An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...

This paper considers a stochastic optimization problem over the fixed point sets of quasinonexpansive mappings on Riemannian manifolds. The enables us to consider hierarchical problems complicated sets, such as intersection many closed convex set all minimizers nonsmooth function, and sublevel functions. We focus adaptive learning rate algorithms, which adapt step-sizes (referred rates in machi...

This note describes a method for computing estimates of the rigid transformation G and estimates of the coordinates of a set of n points P1, . . . ,Pn in the two camera reference frames from the n pairs (x1,y ′ 1), . . . (xn,y ′ n) of noisy measurements of their corresponding images. The transformation G is called camera motion, and the point coordinates Xi, Xi of the world points in the two re...

We present a general walk-through point location algorithm for use with general polyhedron lattices and polygonal meshes assuming the usage of nothing more than a simple linked list as a data structure to store the polyhedra. The generality of the approach stems from using barycentric coordinates to extract local information about the location of the query point that allows a ‘gradient descent’...