Programmation linéaire en nombres entiers : optimisation dans un cone
Programmation linéaire et comptabilité analytique
Programmation linéaire mixte : conditions de validité dans les méthodes arborescentes
Programmazione matematica e classificazione
Programme stochastique pour les plans hommes-machines à moyen terme
Programmes mathématiques mixtes. Application au principe du maximum en temps discret dans le cas déterministe et dans le cas stochastique
Programming with parametric elements of the matrix coefficients
Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid.
Projection method with level control in convex minimization
We study a projection method with level control for nonsmoooth convex minimization problems. We introduce a changeable level parameter to level control. The level estimates the minimal value of the objective function and is updated in each iteration. We analyse the convergence and estimate the efficiency of this method.
Projection method with residual selection for linear feasibility problems
We propose a new projection method for linear feasibility problems. The method is based on the so called residual selection model. We present numerical results for some test problems.
Projection on a cone and generalized penalty functionals for problems with constraints in Hilbert space
Projective algorithms for solving complementarity problems.
Prolongement des jeux à deux joueurs de somme nulle. Une théorie abstraite des duels
Proper orthogonal decomposition for optimality systems
Proper orthogonal decomposition (POD) is a powerful technique for model reduction of non-linear systems. It is based on a Galerkin type discretization with basis elements created from the dynamical system itself. In the context of optimal control this approach may suffer from the fact that the basis elements are computed from a reference trajectory containing features which are quite different from those of the optimally controlled trajectory. A method is proposed which avoids this problem of unmodelled...
Properties of projection and penalty methods for discretized elliptic control problems
In this paper, properties of projection and penalty methods are studied in connection with control problems and their discretizations. In particular, the convergence of an interior-exterior penalty method applied to simple state constraints as well as the contraction behavior of projection mappings are analyzed. In this study, the focus is on the application of these methods to discretized control problem.
Properties of solutions of optimization problems for set functions.
Proto-differentiability of set-valued mappings and its applications in optimization
Proximal smoothness and the lower- property.
Prox-mappings associated with a pair of Legendre conjugate functions
Pseudomonotonicity and related properties in Euclidean Jordan algebras.