Sparse Hessian factorization in curved trajectories for unconstrained minimization

Jimenez, A.

doi:10.1080/10556788.2012.707652

Search citation statements

Order By: Relevance

Paper Sections

Select...

Black Box Optimization Competition (Bbcomp)1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

2018

Publication Types

Select...

Article2

Other1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[195] and the Mean-Variance Mapping Optimization (MVMO) [196] algorithm. KNITRO, developed by Byrd et al [195] at [197] 689.558 RBFOpt [198] 669.860 SaDE: Self-adaptive DE [199] 607.344 b6e6rl [200] 568 Chapter 5…”

Section: Black Box Optimization Competition (Bbcomp)mentioning

confidence: 99%

Multi-scale search for black-box optimization : theory & algorithms

Al-Dujaili¹

View full text Add to dashboard Cite

This thesis focuses on a special class of Mathematical Programming (MP) algorithms for continuous black-box optimization. Black-box optimization has been a recurrent subject of interest for decades, as many real-world applications can be modeled as black-box optimization problems. In particular, this research work studies algorithms that partition the problem's decision space over multiple scales in search for the optimal solution and investigates three central topics.

show abstract