Problemi di ottimizzazione nella teoria delle code
Programming with parametric elements of the matrix coefficients
Prolongement des jeux à deux joueurs de somme nulle. Une théorie abstraite des duels
Rectifiabilité quantifié et le problème du voyageur de commerce
Reformulations in Mathematical Programming: Definitions and Systematics
A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts to move...
Strong convergence theorems for countable Lipschitzian mappings and its applications in equilibrium and optimization problems.
Sufficient decrease principle on Riemannian manifolds.
The Algebraic Degree of Geometric Optimization Problems.
The gradient method for non-differentiable operators in product Hilbert spaces and applications to elliptic systems of quasilinear differential equations.
Un problema de búsqueda de una recta.
En este trabajo se estudia el problema de la búsqueda de una recta de entre n tangentes a una circunferencia. Se da un método para calcular la longitud media óptima del camino recorrido hasta encontrar la recta. Se obtienen ecuaciones que determinan la trayectoria solución de este problema.
Une heuristique pour le problème de l'arbre de Steiner
К вопросу о выборе направлений спуска в задачах безусловной минимизации функций
Метод вентров с адаптацией параметров на основе наискорейшего спуска
Метод нахождения минимакса при наличии ограничений
Необходимые условия в задачах математического программирования и дискретной оптимизации
Об одном методе отыскания минимакса
Уточнение оценок скорости сходимости метода случайного поиска