#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1995

2017

- This year (2)
- Last 5 years (8)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Walter F. Mascarenhas
- Math. Program.
- 2004

This work shows that the BFGS method and other methods in the Broyden class, with exact line searches, may fail for non-convex objective functions.

This article presents maximum likelihood estimators (MLEs) and log-likelihood ratio (LLR) tests for the eigenvalues and eigenvectors of Gaussian random symmetric matrices of arbitrary dimension, where the observations are independent repeated samples from one or two populations. These inference problems are relevant in the analysis of diffusion tensor… (More)

- Roberto Cominetti, Walter F. Mascarenhas, Paulo J. S. Silva
- Math. Program. Comput.
- 2014

We introduce a new efficient method to solve the continuous quadratic knapsack problem. This is a highly structured quadratic program that appears in different contexts. The method converges after O(n) iterations with overall arithmetic complexity O(n 2). Numerical experiments show that in practice the method converges in a small number of iterations with… (More)

- Walter F. Mascarenhas
- SIAM J. Matrix Analysis Applications
- 1995

- Walter F. Mascarenhas
- Numerische Mathematik
- 2014

We discuss the convergence of line search methods for minimization. We explain how Newton's method and the BFGS method can fail even if the restrictions of the objective function to the search lines are strictly convex functions, the level sets of the objective functions are compact, the line searches are exact and the Wolfe conditions are satisfied. This… (More)

- Walter F. Mascarenhas
- SIAM Journal on Optimization
- 1997

- Walter F. Mascarenhas
- Math. Program.
- 2008

In this note we discuss the convergence of Newton's method for minimization. We present examples in which the Newton iterates satisfy the Wolfe conditions and the Hessian is positive definite at each step and yet the iterates converge to a non-stationary point. These examples answer a question posed by Fletcher in his 1987 book Practical methods of… (More)

A new method is introduced for packing objects in convex regions of the Euclidian n-dimensional space. By means of this approach the packing problem becomes a global finite-dimensional continuous optimization problem. The strategy is based on the new concept of sentinels sets. Sentinels sets are finite subsets of the objects to be packed such that when two… (More)

- Walter F. Mascarenhas, André Pierro de Camargo
- Numerische Mathematik
- 2017