Pages that link to "Item:Q1188890"

The following pages link to A collection of test problems for constrained global optimization algorithms (Q1188890):

Displaying 50 items.

• Global optimality conditions for nonconvex minimization problems with quadratic constraints (Q265137) (← links)
• Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
• Stochastic filter methods for generally constrained global optimization (Q300752) (← links)
• Test problem generator for unconstrained global optimization (Q337165) (← links)
• Biogeography-based optimization for constrained optimization problems (Q339689) (← links)
• A double-multiplicative dynamic penalty approach for constrained evolutionary optimization (Q373947) (← links)
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
• On linear programs with linear complementarity constraints (Q452341) (← links)
• A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem (Q495077) (← links)
• Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
• Piecewise convex maximization problems: Piece adding technique (Q535077) (← links)
• On the utility of randomly generated functions for performance evaluation of evolutionary algorithms (Q601978) (← links)
• Piece adding technique for convex maximization problems (Q604949) (← links)
• Partitioning procedure for polynomial optimization (Q604960) (← links)
• Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions (Q614061) (← links)
• Study of multiscale global optimization based on parameter space partition (Q620530) (← links)
• Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (Q625645) (← links)
• A projected-gradient interior-point algorithm for complementarity problems (Q634730) (← links)
• CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method (Q679580) (← links)
• Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type (Q685859) (← links)
• Extended duality for nonlinear programming (Q707770) (← links)
• Properties and numerical testing of a parallel global optimization algorithm (Q715140) (← links)
• A filled function method for global optimization with inequality constraints (Q725788) (← links)
• Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
• Smoothing of the lower-order exact penalty function for inequality constrained optimization (Q737061) (← links)
• Genetic algorithm for constrained global optimization in continuous variables (Q814754) (← links)
• Smoothing approximation to the lower order exact penalty function for inequality constrained optimization (Q824593) (← links)
• Modular global optimisation in chemical engineering (Q842720) (← links)
• Linearly constrained global optimization and stochastic differential equations (Q857812) (← links)
• A filled function method for constrained global optimization (Q925228) (← links)
• Self-adaptive velocity particle swarm optimization for solving constrained optimization problems (Q934798) (← links)
• A fast memoryless interval-based algorithm for global optimization (Q975771) (← links)
• The oracle penalty method (Q975775) (← links)
• A one-parameter filled function method applied to nonsmooth constrained global optimization (Q979943) (← links)
• Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
• A dynamic programming extension to the steady state refinery-LP (Q1014942) (← links)
• Towards ``Ideal multistart''. A stochastic approach for locating the minima of a continuous function inside a bounded domain (Q1030234) (← links)
• More test examples for nonlinear programming codes (Q1111932) (← links)
• Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
• Generating quadratic assignment test problems with known optimal permutations (Q1203071) (← links)
• Evolution program for deterministic and stochastic optimizations (Q1278350) (← links)
• On proving existence of feasible points in equality constrained optimization problems (Q1290652) (← links)
• Handbook of test problems in local and global optimization (Q1304172) (← links)
• Parallel computing in nonconvex programming (Q1309859) (← links)
• New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints (Q1310977) (← links)
• A new technique for generating quadratic programming test problems (Q1315416) (← links)
• Primal-relaxed dual global optimization approach (Q1321372) (← links)
• On global optimization in two-dimensional scaling (Q1321575) (← links)
• Global minimization by reducing the duality gap (Q1322556) (← links)
• Application of Bayesian approach to numerical methods of global and stochastic optimization (Q1327427) (← links)