Représentation de matrices euclidiennes en vue de leur génération aléatoire
Representations of non-negative polynomials via KKT ideals
This paper studies the representation of a non-negative polynomial f on a non-compact semi-algebraic set K modulo its KKT (Karush-Kuhn-Tucker) ideal. Under the assumption that f satisfies the boundary Hessian conditions (BHC) at each zero of f in K, we show that f can be represented as a sum of squares (SOS) of real polynomials modulo its KKT ideal if f ≥ 0 on K.
Rescaled proximal methods for linearly constrained convex problems
We present an inexact interior point proximal method to solve linearly constrained convex problems. In fact, we derive a primal-dual algorithm to solve the KKT conditions of the optimization problem using a modified version of the rescaled proximal method. We also present a pure primal method. The proposed proximal method has as distinctive feature the possibility of allowing inexact inner steps even for Linear Programming. This is achieved by using an error criterion that bounds the subgradient...
Researches of the transportation problem
Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques
The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target architecture....
Resolución por programación paramétrica del problema multiobjetivo lineal difuso.
En este artículo se propone una solución difusa al problema Multiobjetivo Lineal Difuso. Tal solución contiene, como valores particulares, las soluciones puntuales que otros autores han obtenido. El método que se emplea es independiente de las funciones de pertenencia que se consideren. El problema también se extiende al caso en que el conjunto de restricciones sea, junto con los objetivos, difuso.
Résolution de problèmes d'optimisation dynamique par programmation dynamique marginaliste
Résolution de programmes linéaires entiers ou mixtes à l'aide de la forme normale de Hermite
Résolution des problèmes de multiflots en nombres entiers dans les grands réseaux
Résolution directe du problème général de distribution
Résolution d'un problème d'ordonnancement cyclique à itérations indépendantes et contraintes de ressources
Résolution d'un programme quadratique en variantes bivalentes par décomposition application au placement de commutateurs dans un réseau
Résolution numérique de certains problèmes de commande optimale
Résolution paramétrée de familles de systèmes linéaires
Results of short-period helicopter system identification using output-error and hybrid search-gradient optimization algorithm.
ReSySTER: A hybrid recommender system for Scrum team roles based on fuzzy and rough sets
Agile development is a crucial issue within software engineering because one of the goals of any project leader is to increase the speed and flexibility in the development of new commercial products. In this sense, project managers must find the best resource configuration for each of the work packages necessary for the management of software development processes in order to keep the team motivated and committed to the project and to improve productivity and quality. This paper presents ReSySTER,...
Reverse bridge theorem under constraint partition.
Reverse convex problems: an approach based on optimality conditions.
Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality
Based on conjugate duality we construct several gap functions for general variational inequalities and equilibrium problems, in the formulation of which a so-called perturbation function is used. These functions are written with the help of the Fenchel-Moreau conjugate of the functions involved. In case we are working in the convex setting and a regularity condition is fulfilled, these functions become gap functions. The techniques used are the ones considered in [Altangerel L., Boţ R.I., Wanka...
Riemannian convexity.