Christopher John Price

Comput. Stat. Data Anal., March, 2024

2022

Direct search nonsmooth constrained optimization via rounded ℓ<sub>1</sub> penalty functions.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2022

2021

Oscars-ii: an algorithm for bound constrained global optimization.

[BibT_eX]

[DOI]

J. Glob. Optim., 2021

2016

Stochastic filter methods for generally constrained global optimization.

[BibT_eX]

[DOI]

Darshana Chitraka Wickramarachchi

J. Glob. Optim., 2016

HHCART: An oblique decision tree.

[BibT_eX]

[DOI]

Jennifer Brown

Comput. Stat. Data Anal., 2016

2014

One side cut accelerated random search.

[BibT_eX]

[DOI]

Optim. Lett., 2014

2013

CARTopt: a random search method for nonsmooth unconstrained optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2013

2012

A cover partitioning method for bound constrained global optimization.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2012

2006

Exploiting problem structure in pattern search methods for unconstrained optimization.

[BibT_eX]

[DOI]

Philippe L. Toint

Optim. Methods Softw., 2006

2004

Conjugate Grids for Unconstrained Optimisation.

[BibT_eX]

[DOI]

D. Byatt

Comput. Optim. Appl., 2004

2003

Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach.

[BibT_eX]

[DOI]

SIAM J. Optim., 2003

2002

Positive Bases in Numerical Optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2002

2001

On the Convergence of Grid-Based Methods for Unconstrained Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2001

1996

Numerical experiments in semi-infinite programming.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 1996

1994

Model reuse in diverse problem solvers.

[BibT_eX]

[DOI]