Ana Luísa Custódio

Ana Luísa Custódio

Auto-generated profile, based on publicly available information

Ana Luísa Custódio

NOVA School of Science and Technology Center for Mathematics and Applications (NOVA MATH) Campus de Caparica 2829-516 Caparica Portugal

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2011 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
ACA. L. Custódio
A. L. Custódio
JMJose Firmino Aguilar Madeira
Jose Firmino Aguilar Madeira
AVA. Ismael F. Vaz
A. Ismael F. Vaz
LVL. N. Vicente
L. N. Vicente
In practical applications of optimization it is common to have several conflicting objective functions to optimize. Frequently, these functions are subject to noise or can be of black-box type, preventing the use of derivative-based techniques. We propose a novel multiobjective derivative-free methodology, calling it direct multisearch (DMS), which does not aggregate any of the objective functions. Our framework is inspired by the search/poll paradigm of direct-search methods of directional type and uses the concept of Pareto dominance to maintain a list of nondominated points (from which the new iterates or poll centers are chosen). The aim of our method is to generate as many points in the Pareto front as possible from the polling procedure itself, while keeping the whole framework general enough to accommodate other disseminating strategies, in particular, when using the (here also) optional search step. DMS generalizes to multiobjective optimization (MOO) all direct-search methods of directional type. We prove under the common assumptions used in direct search for single objective optimization that at least one limit point of the sequence of iterates generated by DMS lies in (a stationary form of) the Pareto front. However, extensive computational experience has shown that our methodology has an impressive capability of generating the whole Pareto front, even without using a search step. Two by-products of this paper are (i) the development of a collection of test problems for MOO and (ii) the extension of performance and data profiles to MOO, allowing a comparison of several solvers on a large set of test problems, in terms of their efficiency and robustness to determine Pareto fronts.

1 January 2007 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
ACA. L. Custódio
A. L. Custódio
LVL. N. Vicente
L. N. Vicente
In this paper, we introduce ways of making a pattern search more efficient by reusing previous evaluations of the objective function, based on the computation of simplex derivatives (e.g., simplex gradients). At each iteration, one can attempt to compute an accurate simplex gradient by identifying a sampling set of previously evaluated points with good geometrical properties. This can be done using only past successful iterates or by considering all past function evaluations. The simplex gradient can then be used to reorder the evaluations of the objective function associated with the directions used in the poll step or to update the mesh size parameter according to a sufficient decrease criterion, neither of which requires new function evaluations. We present these procedures in detail and apply them to a set of problems from the CUTEr collection. Numerical results show that these procedures can enhance significantly the practical performance of pattern search methods.

6 August 2009 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
ACA. L. Custódio
A. L. Custódio
HRHumberto Rocha
Humberto Rocha
LVL. N. Vicente
L. N. Vicente

2 December 2010 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
LVL. N. Vicente
L. N. Vicente
ACA. L. Custódio
A. L. Custódio

27 February 2008 in IMA Journal of Numerical Analysis
Verified
Journal Article
Closed access
PDF file
ACA. L. Custodio
A. L. Custodio
JDJ. E. Dennis
J. E. Dennis
LVL. N. Vicente
L. N. Vicente
It has been shown recently that the efficiency of direct search methods that use opportunistic polling in positive spanning directions can be improved significantly by reordering the poll directions according to descent indicators built from simplex gradients. The purpose of this paper is two-fold. First, we analyse the properties of simplex gradients of nonsmooth functions in the context of direct search methods like the generalized pattern search and the mesh adaptive direct search, for which there exists a convergence analysis in the nonsmooth setting. Our analysis does not require continuous differentiability and can be seen as an extension of the accuracy properties of simplex gradients known for smooth functions. Secondly, we test the use of simplex gradients when pattern search is applied to nonsmooth functions, confirming the merit of the poll ordering strategy for such problems.

13 August 2014 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
ACA. L. Custódio
A. L. Custódio
JMJose Firmino Aguilar Madeira
Jose Firmino Aguilar Madeira