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.
Bounds on integrals with respect to multivariate copulas
In this paper, we present a method to obtain upper and lower bounds on integrals with respect to copulas by solving the corresponding assignment problems (AP’s). In their 2014 paper, Hofer and Iacó proposed this approach for two dimensions and stated the generalization to arbitrary dimensons as an open problem. We will clarify the connection between copulas and AP’s and thus find an extension to the multidimensional case. Furthermore, we provide convergence statements and, as applications, we consider...
Constrained optimization: A general tolerance approach
To overcome the somewhat artificial difficulties in classical optimization theory concerning the existence and stability of minimizers, a new setting of constrained optimization problems (called problems with tolerance) is proposed using given proximity structures to define the neighbourhoods of sets. The infimum and the so-called minimizing filter are then defined by means of level sets created by these neighbourhoods, which also reflects the engineering approach to constrained optimization problems....
Critères de choix en avenir incertain : ébauche d'un algorithme d'optimisation
Discrete optimal control problems with nonsmooth costs
Dual of a linear fractional program through geometric programming
Evolution Problems and Minimizing Movements
We recall the definition of Minimizing Movements, suggested by E. De Giorgi, and we consider some applications to evolution problems. With regards to ordinary differential equations, we prove in particular a generalization of maximal slope curves theory to arbitrary metric spaces. On the other hand we present a unifying framework in which some recent conjectures about partial differential equations can be treated and solved. At the end we consider some open problems.
Existence of solutions and star-shapedness in generalized Minty variational inequalities in Banach spaces.
Extrema constrained by a family of curves.
Extremal moment methods and stochastic orders. Application in actuarial science.
Fast projection method for a special class of polytopes with applications