Full metadata record
DC FieldValueLanguage
dc.contributorDepartment of Applied Mathematicsen_US
dc.contributor.advisorChen, Xiaojun (AMA)en_US
dc.contributor.advisorZhang, Zaikun (AMA)en_US
dc.creatorRagonneau, Tom Mael-
dc.publisherHong Kong Polytechnic Universityen_US
dc.rightsAll rights reserveden_US
dc.titleModel-based derivative-free optimization methods and softwareen_US
dcterms.abstractThis thesis studies derivative-free optimization (DFO), particularly model-based methods and software. These methods are motivated by optimization problems for which it is impossible or prohibitively expensive to access the first-order information of the objective function and possibly the constraint functions. Such problems frequently arise in engineering and industrial applications, and keep emerging due to recent advances in data science and machine learning.en_US
dcterms.abstractWe first provide an overview of DFO and interpolation models for DFO methods. In addition, we show that an interpolation set employed by Powell for underdetermined quadratic interpolation is optimal in terms of well-poisedness.en_US
dcterms.abstractWe then present PDFO, a package that we develop to provide both MATLAB and Python interfaces to Powell's model-based DFO solvers, namely COBYLA, UOBYQA, NEWUOA, BOBYQA, and LINCOA. They were implemented by Powell in Fortran 77, and hence, are becoming inaccessible to many users nowadays. PDFO provides user-friendly interfaces to these solvers, so that users do not need to deal with the Fortran code. In addition, it patches bugs in the original Fortran implementation. We also share some observations about the behavior of Powell's solvers.en_US
dcterms.abstractA major part of this thesis is devoted to the development of a new DFO method based on the sequential quadratic programming (SQP) method. Therefore, we first present an overview of the SQP method and provide some perspectives on its theory and practice. In particular, we show that the objective function of the SQP subproblem is a natural quadratic approximation of the original objective function in the tangent space of a surface. Moreover, we propose an extension of the Byrd-Omojokun approach for solving trust-region SQP subproblems with inequality constraints. This extension works quite well in our experiments.en_US
dcterms.abstractFinally, we elaborate on the development of our new DFO method, named COBYQA after Constrained Optimization BY Quadratic Approximations. This derivative-free trust-region SQP method is designed to tackle nonlinearly constrained optimization problems that admit equality and inequality constraints. An important feature of COBYQA is that it always respects bound constraints, if any, which is motivated by applications where the objective function is undefined when bounds are violated. COBYQA builds quadratic trust-region models based on the derivative-free symmetric Broyden update proposed by Powell. We provide a detailed description of COBYQA, including its subproblem solvers, and introduce its Python implementation. We expose extensive numerical experiments of COBYQA, showing evident advantages of COBYQA compared with Powell's DFO solvers. These experiments demonstrate that COBYQA is an excellent successor to COBYLA as a general-purpose DFO solver.en_US
dcterms.extentxxvi, 173 pages : color illustrationsen_US
dcterms.isPartOfPolyU Electronic Thesesen_US
dcterms.educationalLevelAll Doctorateen_US
dcterms.LCSHMathematical modelsen_US
dcterms.LCSHMathematical optimizationen_US
dcterms.LCSHHong Kong Polytechnic University -- Dissertationsen_US
dcterms.accessRightsopen accessen_US

Files in This Item:
File Description SizeFormat 
6715.pdfFor All Users1.45 MBAdobe PDFView/Open

Copyright Undertaking

As a bona fide Library user, I declare that:

  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.

By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

Show simple item record

Please use this identifier to cite or link to this item: https://theses.lib.polyu.edu.hk/handle/200/12294