A gradually descent method for discrete global optimization
From MaRDI portal
Recommendations
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- A Global Search Method for Discrete Stochastic Optimization
- A multidimensional descent method for global optimization
- Global descent method for constrained continuous global optimization
- A descending dimension method of global optimization
- A hybrid descent method for global optimization
- Global descent method for global optimization
- A note on adapting methods for continuous global optimization to the discrete case
- A gradient-based approach for discrete optimum design
- Global descent methods for unconstrained global optimization
Cites work
- A filled function method for finding a global minimizer of a function of several variables
- Introduction to global optimization
- New classes of globally convexized filled functions for global optimization
- Revised filled function methods for global optimization.
- Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
- The globally convexized filled functions for global optimization
- The Tunneling Algorithm for the Global Minimization of Functions
Cited in
(5)- Note on the mean value of higher-Kloosterman sums
- History and prospects for first-order automated deduction
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- Discrete global optimization problems with a modified discrete filled function
This page was built for publication: A gradually descent method for discrete global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5436248)
