Pages that link to "Item:Q1188890"

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

Displayed 50 items.

• On the utility of randomly generated functions for performance evaluation of evolutionary algorithms (Q601978) ‎ (← 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)
• Genetic algorithm for constrained global optimization in continuous variables (Q814754) ‎ (← 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)
• 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)
• 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)
• A generalization of the construction of test problems for nonconvex optimization (Q1330804) ‎ (← links)
• A class of test functions for global optimization (Q1337132) ‎ (← links)
• On the construction of test problems for concave minimization algorithms (Q1342905) ‎ (← links)
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art (Q1348274) ‎ (← links)
• Lower bound functions for polynomials (Q1405189) ‎ (← links)
• Performance of several nonlinear programming software packages on microcomputers. (Q1406691) ‎ (← links)
• Interval mathematics, algebraic equations and optimization (Q1593830) ‎ (← links)
• Some global optimization problems on Stiefel manifolds (Q1768631) ‎ (← links)
• Test problem construction for linear bilevel programming problems (Q1815062) ‎ (← links)
• Rigorous convex underestimators for general twice-differentiable problems (Q1817315) ‎ (← links)
• Linearly constrained global optimization: a general solution algorithm with applications. (Q1855939) ‎ (← links)
• A global optimization algorithm for linear fractional and bilinear programs (Q1890945) ‎ (← links)
• Constructing large feasible suboptimal intervals for constrained nonlinear optimization (Q1904721) ‎ (← links)
• Computational experience with penalty-barrier methods for nonlinear programming (Q1915922) ‎ (← links)
• Designing and reporting on computational experiments with heuristic methods (Q1922625) ‎ (← links)
• A branch-and-reduce approach to global optimization (Q1924068) ‎ (← links)
• Improving the performance of weighted Lagrange-multiplier methods for nonlinear constrained optimization (Q1977849) ‎ (← links)
• A wide class of test functions for global optimization (Q2366963) ‎ (← links)
• Global optimization by continuous grasp (Q2458920) ‎ (← links)
• Investigating a hybrid simulated annealing and local search algorithm for constrained optimization (Q2464206) ‎ (← links)
• Memetic particle swarm optimization (Q2468766) ‎ (← links)
• A cellular framework for structural analysis and optimization (Q2495636) ‎ (← links)
• Computational experience using an edge search algorithm for linear reverse convex programs (Q2564611) ‎ (← links)
• Second order cone programming relaxation of nonconvex quadratic optimization problems (Q2770189) ‎ (← links)
• Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization (Q3509411) ‎ (← links)