L'affectation exponentielle et le problème du plus court chemin dans un graphe
Lagrangean decomposition for integer programming : theory and applications
Large quadratic programming problems generated by rigid body simulation.
Large-scale nonlinear programming algorithm using projection methods
A method for solving large convex optimization problems is presented. Such problems usually contain a big linear part and only a small or medium nonlinear part. The parts are tackled using two specialized (and thus efficient) external solvers: purely nonlinear and large-scale linear with a quadratic goal function. The decomposition uses an alteration of projection methods. The construction of the method is based on the zigzagging phenomenon and yields a non-asymptotic convergence, not dependent...
Le traitement des solutions quasi optimales en programmation linéaire continue : une synthèse
Least Squares with a Quadratic Constraint.
Line Search by Curve Fitting in Minimization Algorithms.
Local Convergence Analysis for Partitioned Quasi-Newton Updates.
Local convergence for the curve tracing of the homotopy method.
Mapping the convergence of genetic algorithms.
Mathematical programming via the least-squares method
The least-squares method is used to obtain a stable algorithm for a system of linear inequalities as well as linear and nonlinear programming. For these problems the solution with minimal norm for a system of linear inequalities is found by solving the non-negative least-squares (NNLS) problem. Approximate and exact solutions of these problems are discussed. Attention is mainly paid to finding the initial solution to an LP problem. For this purpose an NNLS problem is formulated, enabling finding...
Maximal flow problem in a network with a variable structure
Maximization of distances of regular polygons on a circle
This paper presents the solution of a basic problem defined by J. Černý which solves a concrete everyday problem in railway and road transport (the problem of optimization of time-tables by some criteria).
Max-separable equations and the set covering
Mesh-independence and preconditioning for solving parabolic control problems with mixed control-state constraints
Optimal control problems for the heat equation with pointwise bilateral control-state constraints are considered. A locally superlinearly convergent numerical solution algorithm is proposed and its mesh independence is established. Further, for the efficient numerical solution reduced space and Schur complement based preconditioners are proposed which take into account the active and inactive set structure of the problem. The paper ends by numerical tests illustrating our theoretical findings and...
Mesh-independence and preconditioning for solving parabolic control problems with mixed control-state constraints
Optimal control problems for the heat equation with pointwise bilateral control-state constraints are considered. A locally superlinearly convergent numerical solution algorithm is proposed and its mesh independence is established. Further, for the efficient numerical solution reduced space and Schur complement based preconditioners are proposed which take into account the active and inactive set structure of the problem. The paper ends by numerical tests illustrating our theoretical findings and comparing...
Méthodes de résolution du problème de transport et de production d'une entreprise à établissements multiples en présence de coûts fixes
Méthodes de simulation en programmation dynamique stochastique
Méthodes du second ordre dans les problèmes d'optimisation avec contraintes
Méthodes numériques pour la décomposition et la minimisation de fonctions non differentiates.