DOIAbstract
AbstractWe give a detailed analysis of the rate of convergence of the pth power minimum of an affine subspace of Rn as p → ∞
AbstractWe give a detailed analysis of the rate of convergence of the pth power minimum of an affine subspace of Rn as p → ∞
AbstractLet {Xi:i⩾1} be i.i.d. uniform points on [−1/2,1/2]d, d⩾2, and for 0<p<∞. Let L({X1,…,Xn},p)...
We study the linear convergence of variants of the Frank-Wolfe algorithms for some classes of strong...
Tsuchiya and Muramatsu recently proved that the affine-scaling algorithm for linear programming gene...
AbstractWe give a detailed analysis of the rate of convergence of the pth power minimum of an affine...
AbstractIn this paper, we consider the problem of best approximation in ℓp(n), 1⩽p⩽∞. If hp, 1⩽p⩽∞, ...
AbstractIn this paper we consider the problem of best approximation in ℓp(N), 1<p⩽∞. If hp, 1<p<∞ de...
AbstractIn approximating an arbitrary point of Rn from a fixed subspace, it is known that the net of...
AbstractThe rate of convergence of the discrete Pólya-1 algorithm is studied. Examples are given to ...
—A minimum-length vector is found for a simplex in a finite-dimensional Euclidean space. The algorit...
AbstractIn this paper we consider a problem of best approximation in ℓp, 1<p⩽∞. Let hp denote the be...
AbstractLet hp, 1<p<∞, be the best ℓp-approximation of the element h∈Rn from a proper affine subspac...
The Polýa algorithm is the calculation of best L p -approximants of f as p→∞. In this paper we inves...
This is a survey of algorithmic results in the theory of "discrete convex analysis" for in...
In the present paper, we investigate a linearized p roximal algorithm (LPA) for solving a convex com...
AbstractLet X = C[0, 1] and let b be the set of continuous convex functions on [0, 1]. If ƒ ϵ X, the...
AbstractLet {Xi:i⩾1} be i.i.d. uniform points on [−1/2,1/2]d, d⩾2, and for 0<p<∞. Let L({X1,…,Xn},p)...
We study the linear convergence of variants of the Frank-Wolfe algorithms for some classes of strong...
Tsuchiya and Muramatsu recently proved that the affine-scaling algorithm for linear programming gene...
AbstractWe give a detailed analysis of the rate of convergence of the pth power minimum of an affine...
AbstractIn this paper, we consider the problem of best approximation in ℓp(n), 1⩽p⩽∞. If hp, 1⩽p⩽∞, ...
AbstractIn this paper we consider the problem of best approximation in ℓp(N), 1<p⩽∞. If hp, 1<p<∞ de...
AbstractIn approximating an arbitrary point of Rn from a fixed subspace, it is known that the net of...
AbstractThe rate of convergence of the discrete Pólya-1 algorithm is studied. Examples are given to ...
—A minimum-length vector is found for a simplex in a finite-dimensional Euclidean space. The algorit...
AbstractIn this paper we consider a problem of best approximation in ℓp, 1<p⩽∞. Let hp denote the be...
AbstractLet hp, 1<p<∞, be the best ℓp-approximation of the element h∈Rn from a proper affine subspac...
The Polýa algorithm is the calculation of best L p -approximants of f as p→∞. In this paper we inves...
This is a survey of algorithmic results in the theory of "discrete convex analysis" for in...
In the present paper, we investigate a linearized p roximal algorithm (LPA) for solving a convex com...
AbstractLet X = C[0, 1] and let b be the set of continuous convex functions on [0, 1]. If ƒ ϵ X, the...
AbstractLet {Xi:i⩾1} be i.i.d. uniform points on [−1/2,1/2]d, d⩾2, and for 0<p<∞. Let L({X1,…,Xn},p)...
We study the linear convergence of variants of the Frank-Wolfe algorithms for some classes of strong...
Tsuchiya and Muramatsu recently proved that the affine-scaling algorithm for linear programming gene...
Add to ORKG