Dominique Orban
BackCahiers du GERAD
78 results — page 4 of 4
Interior-point methods in augmented form for linear and convex quadratic programming require the solution of a sequence of symmetric indefinite linear ...
BibTeX reference
Parameterizing source code for architecture-bound optimization is a common approach to high-performance programming but one that makes the programmer's task ...
BibTeX reference
We propose a modified primal-dual interior-point method for nonlinear programming that relaxes the requirement of closely following the central path and lend...
BibTeX reference
In the context of algorithmic parameter optimization, there is much room for efficient usage of computational resources. We consider the OPAL framework in wh...
BibTeX reference
A mixed interior/exterior-point method for nonlinear programming is described, that handles constraints by way of an <i>l</i><sub>1</sub>-penalty function. A...
BibTeX reference
We introduce the OPAL framework in which the identification of good algorithmic parameters is interpreted as a black box optimization problem whose variables...
BibTeX reference
This intentionally short tutorial is an introduction to the main features of AMPL that are relevant to nonlinear optimization model authoring. Pointers are g...
BibTeX reference
The Improved Primal Simplex algorithm IPS [8] is a dynamic constraint reduction method particularly effective on degenerate linear programs. It is able to ac...
BibTeX reference
We present a procedure for self calibration of a pinhole camera subject to radial distortion. Radial distortion parameters are estimated using a nonlinear le...
BibTeX reference
We propose a class of projected Krylov methods for the solution of unsymmetric augmented systems of equations such as those arising from the finite-element f...
BibTeX reference
We describe LANCELOT_simple, an interface to the LANCELOT B nonlinear optimization package within the GALAHAD library (Gould, Orban and Toint, 2003) which ig...
BibTeX referenceConvexity and Concavity Detection in Computational Graphs. Tree Walks for Convexity Proving
In this paper, we examine sets of tools associated to modeling systems for mathematical programming which can be used to automatically detect the presence ...
BibTeX reference
We recall the use of squared slacks used to transform inequality constraints into equalities and several reasons why their introduction may be harmful in ...
BibTeX referenceDrAmpl - A meta solver for optimization
Optimization problems modeled in the AMPL modeling language [Fourer, Gay and Kernighan (2002)] may be examined by a set of tools found in the AMPL Library [...
BibTeX reference
We propose a unified framework for the update of the barrier parameter in interiorpoint methods for nonlinear programming. The original primal-dual system i...
BibTeX reference
The objectives of this paper are twofold; we first demonstrate the flexibility of the mesh adaptive direct search (MADS) in identifying locally optimal algo...
BibTeX reference
In this paper, we examine the sensitivity of trust-region algorithms on the param- eters related to the step acceptance and update of the trust region. We s...
BibTeX reference
Recent developments in numerical methods for solving large differentiable nonlinear optimization problems are reviewed. State-of-the-art algorithms for solv...
BibTeX reference