Cone convexity of measured set vector functions and vector optimization
Cone-constrained linear equations in Banach spaces.
Configuration des lignes d'usinage à boîtiers multibroches : une approche mixte
Ce travail porte sur l'optimisation des lignes d'usinage pour la grande série. Une telle ligne comporte plusieurs postes de travail, chacun étant équipé avec boîtiers multibroches. Un boîtier multibroche exécute plusieurs opérations en parallèle. Lors de la conception en avant-projet, il est nécessaire d'affecter toutes les opérations à des boîtiers et des postes de travail de sorte à minimiser le nombre de postes et de boîtiers utilisés. Pour ce nouveau problème d'équilibrage des lignes de production,...
Configuring a sensor network for fault detection in distributed parameter systems
The problem of fault detection in distributed parameter systems (DPSs) is formulated as that of maximizing the power of a parametric hypothesis test which checks whether or not system parameters have nominal values. A computational scheme is provided for the design of a network of observation locations in a spatial domain that are supposed to be used while detecting changes in the underlying parameters of a distributed parameter system. The setting considered relates to a situation where from among...
Conical differentiability for bone remodeling contact rod models
We prove the conical differentiability of the solution to a bone remodeling contact rod model, for given data (applied loads and rigid obstacle), with respect to small perturbations of the cross section of the rod. The proof is based on the special structure of the model, composed of a variational inequality coupled with an ordinary differential equation with respect to time. This structure enables the verification of the two following fundamental results: the polyhedricity of a modified displacement...
Conical differentiability for bone remodeling contact rod models
We prove the conical differentiability of the solution to a bone remodeling contact rod model, for given data (applied loads and rigid obstacle), with respect to small perturbations of the cross section of the rod. The proof is based on the special structure of the model, composed of a variational inequality coupled with an ordinary differential equation with respect to time. This structure enables the verification of the two following fundamental results: the polyhedricity of a modified displacement constraint...
Conjugate direction algorithms for extended conic functions
Conjugate gradient algorithm and fractals.
Conjugate gradient algorithm for optimal control problems with parameters
Conjugate gradient algorithms for conic functions
The paper contains a description and an analysis of two modifications of the conjugate gradient method for unconstrained minimization which find a minimum of the conic function after a finite number of steps. Moreover, further extension of the conjugate gradient method is given which is based on a more general class of the model functions.
Consistance, complétude et traduction optimale des tables de décision
Consistency checking within local search applied to the frequency assignment with polarization problem
We present a hybrid approach for the Frequency Assignment Problem with Polarization. This problem, viewed as Max-CSP, is treated as a sequence of decision problems, CSP like. The proposed approach combines the Arc-Consistency techniques with a performed Tabu Search heuristic. The resulting algorithm gives some high quality solutions and has proved its robustness on instances with approximately a thousand variables and nearly ten thousand constraints.
Consistency checking within local search applied to the frequency assignment with polarization problem
We present a hybrid approach for the Frequency Assignment Problem with Polarization. This problem, viewed as Max-CSP, is treated as a sequence of decision problems, CSP like. The proposed approach combines the Arc-Consistency techniques with a performed Tabu Search heuristic. The resulting algorithm gives some high quality solutions and has proved its robustness on instances with approximately a thousand variables and nearly ten thousand constraints.
Consistency of minimizers and the SLLN for stochastic programs.
Consistency-driven approximation of a pairwise comparison matrix
The pairwise comparison method is an interesting technique for building a global ranking from binary comparisons. In fact, some web search engines use this method to quantify the importance of a set of web sites. The purpose of this paper is to search a set of priority weights from the preference information contained in a general pairwise comparison matrix; i.e., a matrix without consistency and reciprocity properties. For this purpose, we consider an approximation methodology within a distance-based...
Constrained estimation and the theorem of Kuhn-Tucker.
Constrained optimality problem of Markov decision processes with Borel spaces and varying discount factors
This paper focuses on the constrained optimality of discrete-time Markov decision processes (DTMDPs) with state-dependent discount factors, Borel state and compact Borel action spaces, and possibly unbounded costs. By means of the properties of so-called occupation measures of policies and the technique of transforming the original constrained optimality problem of DTMDPs into a convex program one, we prove the existence of an optimal randomized stationary policies under reasonable conditions.
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....
Constrained optimization via unconstrained minimization
Constrained stabilization of a dynamic systems: a case study
In this work we consider the problem of determining and implementing a state feedback stabilizing control law for a laboratory two-tank dynamic system in the presence of state and control constraints. We do this by exploiting the properties of the polyhedral Lyapunov functions, i. e. Lyapunov functions whose level surfaces are polyhedra, in view of their capability of providing an arbitrarily good approximation of the maximal set of attraction, which is the largest set of initial states which can...