# Engineering (engineering design, digital design)

Back## Cahiers du GERAD

### 216 results — page 4 of 11

The Ninth Montreal IPSW took place on August 19-23, 2019, and was jointly organized by the CRM and IVADO (Institute for Data Valorization). The workshop welc...

BibTeX reference

We propose a new stochastic variance-reduced damped L-BFGS algorithm, where we leverage estimates of bounds on the largest and smallest eigenvalues of the He...

BibTeX reference

This work reviews blackbox optimization applications over the last twenty years, addressed using direct search optimization methods. Emphasis is placed on...

BibTeX reference

The design of key nonlinear systems often requires the use of expensive blackbox simulations presenting inherent discontinuities whose positions in the varia...

BibTeX reference

We consider the iterative solution of regularized saddle-point systems. When the leading block is symmetric and positive semi-definite on an appropriate sub...

BibTeX reference

We provide eigenvalues bounds for a new formulation of the step equations in interior methods for convex quadratic optimization. The matrix of our formulati...

BibTeX reference

In derivative-free and blackbox optimization, the objective function is often evaluated through the execution of a computer program seen as a blackbox. It ...

BibTeX referenceLearning chordal extensions

A highly influential ingredient of many techniques designed to exploit sparsity in numerical optimization is the so-called chordal extension of a graph repre...

BibTeX reference

We introduce an iterative method named BiLQ for solving general square linear systems `\(Ax=b\)`

based on the Lanczos biorthogonalization process defined by ...

In this paper, we compare the BFGS and the conjugate gradient (CG) methods for solving unconstrained problems with a trust-region algorithm. The main result ...

BibTeX reference

Statistical image reconstruction in X-Ray computed tomography yields large-scale regularized linear least-squares problems with nonnegativity bounds, where t...

BibTeX referencePost-separation feature reduction

Reducing the number of features used in data classification can remove noisy or redundant features, reduce the cost of data collection, and improve the accur...

BibTeX reference

We build upon Estrin et al. (2019) to develop a general constrained nonlinear optimization algorithm based on a smooth penalty function proposed by Fletch...

BibTeX reference

The minimum residual method (MINRES) of Paige and Saunders (1975), which is often the method of choice for symmetric linear systems, is a generalization of t...

BibTeX reference

We propose an iterative method named USYMLQR for the solution of symmetric saddle-point systems that exploits the orthogonal tridiagonalization method of Sa...

BibTeX reference

We propose a regularization method for nonlinear least-squares problems with equality constraints. Our approach is modeled after those of Arreckx and Orban ...

BibTeX reference

The present work is in a context of derivative-free optimization involving direct search algorithms guided by surrogate models of the original problem. The...

BibTeX reference

In the interest of full disclosure, the reader is advised that I am biased positively towards the book considered here as I have collaborated with its first ...

BibTeX referenceImplementing a smooth exact penalty function for equality-constrained nonlinear optimization

We develop a general equality-constrained nonlinear optimization algorithm based on a smooth penalty function proposed by Fletcher (1970). Although it was ...

BibTeX reference

Algorithms for finding sparse solutions of underdetermined systems of linear equations have been the subject of intense interest in recent years, sparked b...

BibTeX reference