声明
Contents
论文创新点
摘要
Abstract
Chapter 1 Introduction
1.1 Motivation and related approaches
1.1.1 Noneonvex separable optimization problems
1.1.2 Separable optimization problems with unavailable derivatives
1.2 Organization of the thesis
Chapter 2 Preliminaries
2.1 The basic trust-region algorithm
2.2 The notion of a filter
2.3 Basic materia for derivative-free optimization
2.3.1 Basic concepts in polynomial interpolation
2.3.2 Lagrange polynomials
2.3.3 Polynomial interpolation models
Chapter 3 A Structured Trust Region Method for Nonconvex Programming with Separable Structure
3.1 Introduction
3.2 Structured trust region algorithm
3.2.1 The model
3.2.2 Computing the trial step
3.2.3 A structured trust region algorithm
3.3 Convergence analysis
3.4 Numerical experiments
3.5 Summary
Chapter 4 An Alternating Structured Trust Region Algorithm for Separable Optimization Problems with Nonconvex Constraints
4.1 Introduction
4.2 An alternating structured trust region algorithm
4.2.1 The model functions
4.2.2 Compute the new iterate and sufficient model decrease
4.2.3 The filter as a criterion to accept trial points
4.2.4 An alternating structured trust region algorithm
4.3 Convergence analysis
4.4 Numerical experiments
4.5 Summary
Chapter 5 A Derivative-Free Trust Region Algorithm for Constrained Optimization with Separable Structure
5.1 Introduction
5.2 The trust-region framework and polynomial interpolation
5.2.1 The trust-region framework
5.2.2 Newton interpolation
5.2.3 Improve the geometry of interpolation sets
5.2.4 The filter as a criterion to accept tdal points
5.3 A derivative-free trust region algorithm
5.4 Convergence analysis
5.5 Summary
Chapter 6 Conclusions and Future Work
Bibliography
Publications
Acknowledgements
南京师范大学;