An algorithm for the solution of constrained generalised polynomial programming problems

DOI10.1093/COMJNL/17.3.261MaRDI QIDQ4772102zbMATH OpenOpenAlexFDO

Authors Dana H. Ballard, C. O. Jelinek, Roland Schinzinger

Publication date 1974

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/17.3.261

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cited in

(6)

• Global optimization by controlled random search
• Global optimization algorithms for a CAD workstation
• Integral global minimization: Algorithms, implementations and numerical tests
• The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
• Simulated annealing for constrained global optimization
• On the convergence of the Baba and Dorea random optimization methods

This page was built for publication: An algorithm for the solution of constrained generalised polynomial programming problems

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