On Descent from Local Minima
From MaRDI portal
Cites work
Cited in
(38)- A graphical method for a class of Branin trajectories
- A class of filled functions for finding global minimizers of a function of several variables
- An algorithm for global optimization of Lipschitz continuous functions
- Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
- Unconstrained and constrained global optimization of polynomial functions in one variable
- The normal score transformation applied to a multi-univariate method of global optimization
- Approximation methods for the unconstrained optimization
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
- Cord-slope form of Taylor's expansion in univariate global optimization
- MAKHA -- a new hybrid swarm intelligence global optimization algorithm
- An elite decision making harmony search algorithm for optimization problem
- Revised filled function methods for global optimization.
- Global optimization of Hölder functions
- The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
- A branch-and-reduce approach to global optimization
- Trait-based heterogeneous populations plus (TbHP+ ) genetic algorithm
- Discrete filled function method for discrete global optimization
- A probabilistic cooperative-competitive hierarchical model for global optimization
- A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction
- A framework for globally optimizing mixed-integer signomial programs
- Polynomial genetic programming for response surface modeling. I. A methodology
- An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives
- Eigenvalue decomposition-based modified Newton algorithm
- The dimensional reduction method for identification of parameters that trade-off due to similar model roles
- Global descent methods for unconstrained global optimization
- Computation of multiple global optima through chaotic ant swarm
- Study of multiscale global optimization based on parameter space partition
- Convergence rate of McCormick relaxations
- Mixed-level uniform design with random errors in the level values
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- An improved genetic algorithm with average-bound crossover and wavelet mutation operations
- A new discrete filled function algorithm for discrete global optimization
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- Concurrent stochastic methods for global optimization
- A filled function method for finding a global minimizer of a function of several variables
- Derivative-free simulated annealing and deflecting function technique for global optimization
This page was built for publication: On Descent from Local Minima
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5629143)
