Pages that link to "Item:Q1803605"

The following pages link to A deterministic algorithm for global optimization (Q1803605):

Displaying 37 items.

• Rigorous constraint satisfaction for sampled linear systems (Q328250) (← links)
• Lipschitz gradients for global optimization in a one-point-based partitioning scheme (Q433950) (← links)
• Remembering Leo Breiman (Q542912) (← links)
• Self-adaptive randomized and rank-based differential evolution for multimodal problems (Q656961) (← links)
• Optimal switching between cash-flow streams (Q684138) (← links)
• Sequential importance sampling of binary sequences (Q746178) (← links)
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems (Q813367) (← links)
• Univariate global optimization with multiextremal non-differentiable constraints without penalty functions (Q853549) (← links)
• A modification to the new version of the Price's algorithm for continuous global optimization problems (Q858584) (← links)
• Global optimization in clustering using hyperbolic cross points (Q877116) (← links)
• A deterministic global optimization using smooth diagonal auxiliary functions (Q907200) (← links)
• A new global optimization method for univariate constrained twice-differentiable NLP problems (Q946347) (← links)
• Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms (Q995933) (← links)
• A univariate global search working with a set of Lipschitz constants for the first derivative (Q1024739) (← links)
• Global optimization requires global information (Q1264973) (← links)
• Global one-dimensional optimization using smooth auxiliary functions (Q1290603) (← links)
• Accelerations for a variety of global optimization methods (Q1315439) (← links)
• Accelerations for global optimization covering methods using second derivatives (Q1318273) (← links)
• Experiments with new stochastic global optimization search techniques (Q1571032) (← links)
• Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization (Q1595195) (← links)
• Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms (Q1777602) (← links)
• An algorithm for solving global optimization problems with nonlinear constraints (Q1913609) (← links)
• A partition-based global optimization algorithm (Q1959242) (← links)
• Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives (Q1962986) (← links)
• Volumetric uncertainty bounds and optimal configurations for converging beam triple LIDAR (Q1986160) (← links)
• Parallel two-phase methods for global optimization on GPU (Q1997322) (← links)
• Basin hopping with synched multi L-BFGS local searches. Parallel implementation in multi-CPU and GPUs (Q2009548) (← links)
• Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512) (← links)
• An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems (Q2117623) (← links)
• Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives (Q2199788) (← links)
• A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization (Q2218904) (← links)
• Inheritance properties of Krylov subspace methods for continuous-time algebraic Riccati equations (Q2297136) (← links)
• Krylov subspace methods for discrete-time algebraic Riccati equations (Q2301448) (← links)
• Global optimization on an interval (Q2359788) (← links)
• Customizing methods for global optimization -- a geometric viewpoint (Q2366969) (← links)
• A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems (Q2379688) (← links)
• An efficient implementation of parallel simulated annealing algorithm in GPUs (Q2434644) (← links)