Computational experiments with some approximation algorithms for the travelling salesman problem
Conformal Mappings onto Prescribed Regions via Optimization Techniques.
Conjugate direction algorithms for extended conic functions
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.
Constrained optimization via unconstrained minimization
Construction and features of the optimum rational function used in the ADI-method
Contrôle et amélioration de la précision numérique des codes de programmation linéaire continue
Convergence analysis of adaptive trust region methods
In this paper, we propose a new class of adaptive trust region methods for unconstrained optimization problems and develop some convergence properties. In the new algorithms, we use the current iterative information to define a suitable initial trust region radius at each iteration. The initial trust region radius is more reasonable in the sense that the trust region model and the objective function are more consistent at the current iterate. The global convergence, super-linear and quadratic convergence...
Convergence analysis of preconditioned AOR iterative method for linear systems.
Convergence analysis of the iterative methods for quasi-complementarity problems.
Convergence of a Neumann-Dirichlet algorithm for two-body contact problems with non local Coulomb's friction law
In this paper, the convergence of a Neumann-Dirichlet algorithm to approximate Coulomb's contact problem between two elastic bodies is proved in a continuous setting. In this algorithm, the natural interface between the two bodies is retained as a decomposition zone.
Convergence of a short-step primal-dual algorithm based on the Gauss-Newton direction.
Convergence optimale de l'algorithme de «réallocation-recentrage» dans le cas continu le plus simple
Convergence Results for an Accelerated Nonlinear Cimmino Algorithm.
Derivative Free Analogues of the Levenberg-Marquardt and Gauss Algorithms for Nonlinear Least Squares Approximation.
Détermination rapide d'une solution de base initiale en programmation linéaire continue
Deux algorithmes de programmation mathématique
Deux problèmes d'affectation non linéaires
Differential evolution algorithm combined with chaotic pattern search
Differential evolution algorithm combined with chaotic pattern search(DE-CPS) for global optimization is introduced to improve the performance of simple DE algorithm. Pattern search algorithm using chaotic variables instead of random variables is used to accelerate the convergence of solving the objective value. Experiments on 6 benchmark problems, including morbid Rosenbrock function, show that the novel hybrid algorithm is effective for nonlinear optimization problems in high dimensional space....
Discrete, Nonlinear Approximation Problems in Polyhedral Norms.