scenescene的博客

Accurate modelling of real-world problems often requires nonconvex terms to be introduced in the model, either in the objective function or in the constraints. Nonconvex programming is one of the hardest fields of optimization, presenting many challenges in both practical and theoretical aspects. The presence of multiple local minima calls for the application of global optimization techniques. This paper is a mini-course about global optimization techniques in nonconvex programming; it deals with some theoretical aspects of nonlinear programming as well as with some of the current state- of-the-art algorithms in global optimization. The syllabus is as follows. Some examples of Nonlinear Programming Problems (NLPs). General description of two-phase algorithms. Local optimization of NLPs: derivation of KKT conditions. Short notes about stochastic global multistart algorithms with a concrete example (SobolOpt). In-depth study of a deterministic spatial Branch-and-Bound algorithm, and convex relaxation of an NLP. Latest advances in bilinear programming: the theory of reduction constraints.

现代实验设计优化方法及应用

Optics Handbook Of Optical Materials

Numerical Methods for Partial Differential Equations

Multigrid - Trottenberg

An Introduction to Multigrid Methods

OpenSceneGraph.3.0.Beginners.Guide

Computational Optimization Computational Optimization

Large-Scale Nonlinear Optimization (Nonconvex Optimization and Its Applications) (Gianni Di Pillo, Massimo Roma)

Global Optimization Using Interval Analysis - E. Hansen (CRC) WW

凸 分 析 与 非 线 性 优 化 。

中 国 科 学 院 数 学 课 讲 义 , p d f 文 件