Sequential Search: A Method for Solving Constrained Optimization Problems

DOI10.1145/321250.321256MaRDI QIDQ5538565zbMATH OpenOpenAlexFDO

Authors H. Glass, Leon Cooper

Publication date 1965

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321250.321256

zbMATH Keywords

statistics

Cited in

(7)

• A technique which combines modified pattern search methods with composite designs and polynomial constraints to solve constrained optimization problems
• Nonlinear programming: Global use of the Lagrangian
• The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables
• Derivative-free optimization methods
• The dual of the dual as an approximation of the primal
• scientific article; zbMATH DE number 3272790 (Why is no real title available?)
• A computational study of methods for solving polynomial geometric programs

This page was built for publication: Sequential Search: A Method for Solving Constrained Optimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5538565)