A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
From MaRDI portal
Recommendations
- Global optimization by an improved differential evolutionary algorithm
- An improved differential evolution algorithm for solving constraint optimization problem
- Differential evolution in constrained numerical optimization: an empirical study
- A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization
- An adaptive constraint handling technique for differential evolution with dynamic use of variants in engineering optimization
Cites work
- A branch-and-bound based method for solving monotone optimization problems
- A differential free point generation scheme in the differential evolution algorithm
- A finite algorithm for global minimization of separable concave programs
- A note on composite concave quadratic programming
- An efficient constraint handling method for genetic algorithms
- Construction of test problems for concave minimization under linear and nonlinear constraints
- Convex analysis and global optimization
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Differential evolution in constrained numerical optimization: an empirical study
- Empirical analysis of self-adaptive differential evolution
- Finite exact branch-and-bound algorithms for concave minimization over polytopes
- General variable neighborhood search for the continuous optimization
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Handbook of test problems in local and global optimization
- scientific article; zbMATH DE number 735224 (Why is no real title available?)
- scientific article; zbMATH DE number 757675 (Why is no real title available?)
- scientific article; zbMATH DE number 2217831 (Why is no real title available?)
- Minimizing increasing star-shaped functions based on abstract convexity
- Monotonic optimization: Problems and solution approaches
- New results in the packing of equal circles in a square
- On-line algorithms for computing mean and variance of interval data, and their use in intelligent systems
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Some methods for generating both an NT-net and the uniform distribution on a Stiefel manifold and their applications
- Some variants of the controlled random search algorithm for global optimization
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
Cited in
(4)- Differential evolution for dynamic environments with unknown numbers of optima
- Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization
- A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization
- A differential evolution algorithm with local abstract convex region partition
This page was built for publication: A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656831)
