Sequential Search: A Method for Solving Constrained Optimization Problems
From MaRDI portal
Publication:5538565
DOI10.1145/321250.321256zbMATH Open0156.38804OpenAlexW1970379008MaRDI QIDQ5538565FDOQ5538565
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
Cited In (7)
- A technique which combines modified pattern search methods with composite designs and polynomial constraints to solve constrained optimization problems
- The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables
- The dual of the dual as an approximation of the primal
- Nonlinear programming: Global use of the Lagrangian
- Title not available (Why is that?)
- A computational study of methods for solving polynomial geometric programs
- Derivative-free optimization methods
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)
