Pages that link to "Item:Q813367"

The following pages link to A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems (Q813367):

Displaying 50 items.

• Minimizing the sum of many rational functions (Q266410) (← links)
• A discrete meta-control procedure for approximating solutions to binary programs (Q280551) (← links)
• A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics (Q285928) (← links)
• Enhancing the performance of biogeography-based optimization using polyphyletic migration operator and orthogonal learning (Q336777) (← links)
• Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints (Q367165) (← links)
• Higher and lower-level knowledge discovery from Pareto-optimal sets (Q377755) (← links)
• Global minimum cost design of a welded square stiffened plate supported at four corners (Q381350) (← links)
• Global optimization using a genetic algorithm with hierarchically structured population (Q390485) (← links)
• Differential evolution algorithm with separated groups for multi-dimensional optimization problems (Q421703) (← links)
• Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions (Q433026) (← links)
• Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization (Q471708) (← links)
• A filling function method for unconstrained global optimization (Q493693) (← links)
• Population model-based optimization (Q496596) (← links)
• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
• Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method (Q508045) (← links)
• Real-coded genetic algorithm with uniform random local search (Q529960) (← links)
• Differential evolution with generalized differentials (Q629472) (← links)
• Pattern discrete and mixed hit-and-run for global optimization (Q645554) (← links)
• Subset simulation for unconstrained global optimization (Q651711) (← links)
• A metamodel-assisted evolutionary algorithm for expensive optimization (Q651911) (← links)
• Low dimensional simplex evolution: a new heuristic for global optimization (Q656836) (← links)
• Self-adaptive randomized and rank-based differential evolution for multimodal problems (Q656961) (← links)
• Spectral projected gradient method for stochastic optimization (Q670658) (← links)
• Continuous global optimization through the generation of parametric curves (Q671196) (← links)
• On the convergence of two sequential Monte Carlo methods for maximum a posteriori sequence estimation and stochastic global optimization (Q746254) (← links)
• Comparative assessment of algorithms and software for global optimization (Q813366) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• A simulated annealing driven multi-start algorithm for bound constrained global optimization (Q847248) (← links)
• Some variants of the controlled random search algorithm for global optimization (Q868546) (← links)
• Differential evolution with preferential crossover (Q877595) (← links)
• Globally convergent evolution strategies for constrained optimization (Q887166) (← links)
• Enhancing PSO methods for global optimization (Q984327) (← links)
• Synthesis of the \(\beta\)-distribution as an aid to stochastic global optimization (Q1020794) (← links)
• Gauss-Newton-based BFGS method with filter for unconstrained minimization (Q1021654) (← links)
• Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions (Q1024828) (← links)
• Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms (Q1027518) (← links)
• A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization (Q1029666) (← links)
• The interacting-particle algorithm with dynamic heating and cooling (Q1029697) (← links)
• Best practices for comparing optimization algorithms (Q1642983) (← links)
• Testing the topographical global initialization strategy in the framework of an unconstrained optimization method (Q1653270) (← links)
• Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space (Q1657403) (← links)
• How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (Q1657404) (← links)
• Parallel and interacting stochastic approximation annealing algorithms for global optimisation (Q1703808) (← links)
• An investigation into the performance of particle swarm optimization with various chaotic maps (Q1717827) (← links)
• Stochastic constriction cockroach swarm optimization for multidimensional space function problems (Q1718381) (← links)
• An optimization algorithm inspired by social creativity systems (Q1930872) (← links)
• Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization (Q1935888) (← links)
• A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization (Q1937953) (← links)
• Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
• A deterministic method for continuous global optimization using a dense curve (Q1998159) (← links)