返回
Implementing generating set search methods for linearly constrained minimization
DOI:10.1137/050635432.png)
摘要
En 中文
We discuss an implementation of a derivative-free generating set search method for linearly constrained minimization with no assumption of nondegeneracy placed on the constraints. The convergence guarantees for generating set search methods require that the set of search directions possesses certain geometrical properties that allow it to approximate the feasible region near the current iterate. In the hard case, the calculation of the search directions corresponds to finding the extreme rays of a cone with a degenerate vertex at the origin, a difficult problem. We discuss here how state-of-the-art computational geometry methods make it tractable to solve this problem in connection with generating set search. We also discuss a number of other practical issues of implementation, such as the careful treatment of equality constraints and the desirability of augmenting the set of search directions beyond the theoretically minimal set. We illustrate the behavior of the implementation on several problems from the CUTEr test suite. We have found it to be successful on problems with several hundred variables and linear constraints.
Keyword:
nonlinear programming
nonlinear optimization
constrained optimization
linear constraints
degeneracy
direct search
generating set search
generalized pattern search
derivative-free methods
double description algorithm
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
Optimization by direct search: New perspectives on some classical and modern methods
SIAM REVIEW
IF6.1
Conversion of glucose into 5-hydroxymethylfurfural catalyzed by chromium(iii) Schiff base complexes and acidic ionic liquids immobilized on mesoporous silica
RSC Advances
IF0

