A gradually descent method for discrete global optimization
From MaRDI portal
Publication:5436248
DOI10.1007/s11741-007-0106-1zbMath1174.90711OpenAlexW1966080235MaRDI QIDQ5436248
Yong-jian Yang, Lian-Sheng Zhang
Publication date: 14 January 2008
Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11741-007-0106-1
Related Items
History and Prospects for First-Order Automated Deduction ⋮ Discrete global optimization problems with a modified discrete filled function ⋮ Note on the mean value of higher-Kloosterman sums ⋮ A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
Cites Work
- A filled function method for finding a global minimizer of a function of several variables
- Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
- New classes of globally convexized filled functions for global optimization
- The globally convexized filled functions for global optimization
- Revised filled function methods for global optimization.
- Introduction to global optimization
- The Tunneling Algorithm for the Global Minimization of Functions
This page was built for publication: A gradually descent method for discrete global optimization