A framework for globally convergent algorithms using gradient bounding functions

DOI10.1023/A:1022694608370zbMath0949.90088MaRDI QIDQ1289400

Xiaojun Wang, Tsu-Shuan Chang

Publication date: 28 November 2000

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

global convergencenonlinear programminglinear bounding functions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35)

Uses Software

• CUTEr
• GQTPAR
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A multivariate global optimization using linear bounding functions
• An improved univariate global optimization algorithm with improved linear lower bounding functions
• Computing a Trust Region Step
• Newton’s Method with a Model Trust Region Modification
• CUTE

This page was built for publication: A framework for globally convergent algorithms using gradient bounding functions