Successive approximation technique for a class of large-scale NLP problems and its application to dynamic programming

DOI10.1007/BF00939819zbMath0655.90067MaRDI QIDQ1109685

S. H. Smith

Publication date: 1989

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

zbMATH Keywords

nonconvex optimizationKuhn-Tucker pointdecomposable constraintshigh-dimensional discrete optimal controllarge-scale nonlinear programmingsuccessive approximation techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• One-at-a-time dynamic programming over polytope

This page was built for publication: Successive approximation technique for a class of large-scale NLP problems and its application to dynamic programming