Pages that link to "Item:Q1590262"

The following pages link to Global optimization with non-convex constraints. Sequential and parallel algorithms (Q1590262):

Displaying 50 items.

• Iterative learning control based on extremum seeking (Q254596) (← links)
• On local search in d.c. optimization problems (Q299416) (← links)
• Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem (Q299429) (← links)
• Parallel global optimization on GPU (Q330491) (← links)
• Adaptive nested optimization scheme for multidimensional global search (Q330495) (← links)
• Methods of multiextremal optimization under constraints for separably quasimonotone functions (Q357786) (← links)
• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function (Q386486) (← links)
• Lipschitz global optimization methods in control problems (Q386913) (← links)
• Lipschitz gradients for global optimization in a one-point-based partitioning scheme (Q433950) (← links)
• On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions (Q440675) (← links)
• A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260) (← links)
• Book review of: Ya. D. Sergeyev; R. G. Strongin and D. Lera: Introduction to global optimization exploiting space-filling curves (Q480836) (← links)
• On a global optimization algorithm for bivariate smooth functions (Q481774) (← links)
• FEMOEA: a fast and efficient multi-objective evolutionary algorithm (Q522100) (← links)
• MSO: a framework for bound-constrained black-box global optimization algorithms (Q524912) (← links)
• A new topological minimax theorem with application (Q548181) (← links)
• P-algorithm based on a simplicial statistical model of multimodal functions (Q621736) (← links)
• Higher order numerical differentiation on the infinity computer (Q644507) (← links)
• Continuous global optimization through the generation of parametric curves (Q671196) (← links)
• Canonical dual least square method for solving general nonlinear systems of quadratic equations (Q711390) (← links)
• Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants (Q727093) (← links)
• Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization (Q727229) (← links)
• Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces (Q746814) (← links)
• Monte Carlo method of batch iterations: probabilistic characteristics (Q747227) (← links)
• One-dimensional global optimization for observations with noise (Q814080) (← links)
• Approximate \(k\)-closest-pairs in large high-dimensional data sets (Q814957) (← links)
• Diagonal generalizaton of the DIRECT method for problems with constraints (Q828532) (← links)
• Adaptive global optimization based on a block-recursive dimensionality reduction scheme (Q828539) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• Univariate global optimization with multiextremal non-differentiable constraints without penalty functions (Q853549) (← links)
• Challenges of continuous global optimization in molecular structure prediction (Q877606) (← links)
• Extremum seeking of dynamical systems via gradient descent and stochastic approximation methods (Q889000) (← links)
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems (Q907199) (← links)
• A deterministic global optimization using smooth diagonal auxiliary functions (Q907200) (← links)
• Lipschitz and Hölder global optimization using space-filling curves (Q969306) (← links)
• A univariate global search working with a set of Lipschitz constants for the first derivative (Q1024739) (← links)
• Multidimensional Lipschitz global optimization based on efficient diagonal partitions (Q1029568) (← links)
• Numerical computations and mathematical modelling with infinite and infinitesimal numbers (Q1032541) (← links)
• Best practices for comparing optimization algorithms (Q1642983) (← links)
• Always convergent methods for nonlinear equations of several variables (Q1646676) (← links)
• How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (Q1657404) (← links)
• Generalized parallel computational schemes for time-consuming global optimization (Q1662785) (← 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)
• Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems (Q1713205) (← links)
• Visualization of a statistical approximation of the Pareto front (Q1732235) (← links)
• On modeling and global solutions for d.c. optimization problems by canonical duality theory (Q1734755) (← links)
• A direct search algorithm for global optimization (Q1736805) (← links)
• Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants (Q1754443) (← links)
• Solving a set of global optimization problems by the parallel technique with uniform convergence (Q1754445) (← links)
• Efficient multicriterial optimization based on intensive reuse of search information (Q1754449) (← links)