On geometry and convergence of a class of simplicial covers

DOI10.1080/02331939208843807zbMath0817.90109OpenAlexW2032125804MaRDI QIDQ4327931

Nguyen Van Thoai, Jakob de Vries, Reiner Horst

Publication date: 1 August 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843807

zbMATH Keywords

global optimizationconcave minimizationconvergence conditionssimplicial and conical solution methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Related Items

Constraint decomposition algorithms in global optimization, A new simplicial cover technique in constrained global optimization

Cites Work

• Unnamed Item
• A branch and bound-outer approximation algorithm for concave minimization over a convex set
• Concave minimization via conical partitions and polyhedral outer approximation
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• A new simplicial cover technique in constrained global optimization
• A class of exhaustive cone splitting procedures in conical algorithms for concave minmization