Pages that link to "Item:Q842710"

The following pages link to A review of recent advances in global optimization (Q842710):

Displaying 50 items.

• Protein structure prediction using distributed parallel particle swarm optimization (Q269061) (← links)
• The robust constant and its applications in random global search for unconstrained global optimization (Q280976) (← links)
• Global optimization of signomial geometric programming problems (Q296971) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Adaptive nested optimization scheme for multidimensional global search (Q330495) (← links)
• The method of uniform monotonous approximation of the reachable set border for a controllable system (Q330500) (← links)
• Single-projection procedure for linear optimization (Q330507) (← links)
• Operational planning of combined heat and power plants through genetic algorithms for mixed 0-1 nonlinear programming (Q337450) (← links)
• A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization (Q342520) (← links)
• Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints (Q367165) (← links)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function (Q386486) (← links)
• A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
• Interpretation and optimization of the \(k\)-means algorithm. (Q464720) (← links)
• A new hybrid classical-quantum algorithm for continuous global optimization problems (Q486403) (← links)
• Global optimization of generalized semi-infinite programs via restriction of the right hand side (Q486720) (← links)
• Global optimization by multilevel partition (Q486722) (← links)
• Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption (Q506438) (← links)
• Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
• Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
• Improving the convergence rate of the DIRECT global optimization algorithm (Q522279) (← links)
• Global optimization test problems based on random field composition (Q523165) (← links)
• Equivalent formulations of the gradient (Q548192) (← links)
• A new algorithm for box-constrained global optimization (Q639210) (← links)
• CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method (Q679580) (← links)
• A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
• Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
• An experimental methodology for response surface optimization methods (Q695338) (← links)
• Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
• Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
• Global resolution of the support vector machine regression parameters selection problem with LPCC (Q748597) (← links)
• Fast Gaussian kernel learning for classification tasks based on specially structured global optimization (Q889286) (← links)
• Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
• MEEF: A minimum-elimination-escape function method for multimodal optimization problems (Q1666557) (← links)
• An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems (Q1668794) (← links)
• Convergence-order analysis of branch-and-bound algorithms for constrained problems (Q1668796) (← links)
• Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
• A linearized relaxing algorithm for the specific nonlinear optimization problem (Q1669202) (← links)
• A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set (Q1675572) (← links)
• An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
• Gradient-based cuckoo search for global optimization (Q1718536) (← links)
• A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
• MAKHA -- a new hybrid swarm intelligence global optimization algorithm (Q1736664) (← links)
• An enhanced logarithmic method for signomial programming with discrete variables (Q1752141) (← links)
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
• Composite multilinearity, epistemic uncertainty and risk achievement worth (Q1926938) (← links)
• Registrar: a complete-memory operator to enhance performance of genetic algorithms (Q1928318) (← links)
• One-dimensional center-based l 1-clustering method (Q1936788) (← links)
• A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084) (← links)