A class of self-concordant functions on Riemannian manifolds.
A localization problem in geometry and complexity of discrete programming
A new optimized iterative method for solving -matrix linear systems
In this paper, we present a new iterative method for solving a linear system, whose coefficient matrix is an -matrix. This method includes four parameters that are obtained by the accelerated overrelaxation (AOR) splitting and using the Taylor approximation. First, under some standard assumptions, we establish the convergence properties of the new method. Then, by minimizing the Frobenius norm of the iteration matrix, we find the optimal parameters. Meanwhile, numerical results on test examples...
A note on Gordan's theorem over cone domains.
A Polynomial Solution for the Potato-peeling Problem.
A short note on optimal repair rates of multiple circuit transmission lines
A Theorem On The Optimal Allocation Of Effort.
Algorithm 69. Two distances between hypergraphs
Algorithmes de type F.A.C. en optimisation convexe
An asymptotical variational principle associated with the steepest descent method for a convex function.