The following pages link to On Descent from Local Minima (Q5629143):
Displaying 37 items.
- Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction (Q342078) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Polynomial genetic programming for response surface modeling. I. A methodology (Q438482) (← links)
- An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives (Q445473) (← links)
- Eigenvalue decomposition-based modified Newton algorithm (Q473750) (← links)
- The dimensional reduction method for identification of parameters that trade-off due to similar model roles (Q512694) (← links)
- Global descent methods for unconstrained global optimization (Q548179) (← links)
- Computation of multiple global optima through chaotic ant swarm (Q600603) (← links)
- Study of multiscale global optimization based on parameter space partition (Q620530) (← links)
- Convergence rate of McCormick relaxations (Q656830) (← links)
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems (Q708127) (← links)
- An improved genetic algorithm with average-bound crossover and wavelet mutation operations (Q855212) (← links)
- A new discrete filled function algorithm for discrete global optimization (Q875372) (← links)
- Discrete global descent method for discrete global optimization and nonlinear integer programming (Q878221) (← links)
- Concurrent stochastic methods for global optimization (Q908855) (← links)
- A filled function method for finding a global minimizer of a function of several variables (Q909584) (← links)
- Derivative-free simulated annealing and deflecting function technique for global optimization (Q949241) (← links)
- A graphical method for a class of Branin trajectories (Q1061457) (← links)
- A class of filled functions for finding global minimizers of a function of several variables (Q1077889) (← links)
- An algorithm for global optimization of Lipschitz continuous functions (Q1090241) (← links)
- Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions (Q1102868) (← links)
- Unconstrained and constrained global optimization of polynomial functions in one variable (Q1187372) (← links)
- The normal score transformation applied to a multi-univariate method of global optimization (Q1187843) (← links)
- Approximation methods for the unconstrained optimization (Q1234630) (← links)
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions (Q1310976) (← links)
- Cord-slope form of Taylor's expansion in univariate global optimization (Q1321477) (← links)
- MAKHA -- a new hybrid swarm intelligence global optimization algorithm (Q1736664) (← links)
- An elite decision making harmony search algorithm for optimization problem (Q1760872) (← links)
- Revised filled function methods for global optimization. (Q1854956) (← links)
- Global optimization of Hölder functions (Q1918982) (← links)
- The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization (Q1919839) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- Trait-based heterogeneous populations plus (TbHP+ ) genetic algorithm (Q2389962) (← links)
- Discrete filled function method for discrete global optimization (Q2487474) (← links)
- A probabilistic cooperative-competitive hierarchical model for global optimization (Q2493692) (← links)
- A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice (Q2493820) (← links)
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs (Q2574101) (← links)
