Pages that link to "Item:Q2840349"
From MaRDI portal
The following pages link to Introduction to Global Optimization Exploiting Space-Filling Curves (Q2840349):
Displaying 28 items.
- Iterative MC-algorithm to solve the global optimization problems (Q2397267) (← links)
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case (Q2422871) (← links)
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes (Q2422874) (← links)
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization (Q2660812) (← links)
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics (Q2660836) (← links)
- Optimization by space-densifying curves as a natural generalization of the Alienor method. (Q2776880) (← links)
- On the Least-Squares Fitting of Data by Sinusoids (Q2958622) (← links)
- A Search Algorithm for the Global Extremum of a Discontinuous Function (Q5054157) (← links)
- Stability Analysis of DESA Optimization Algorithm (Q5122269) (← links)
- Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme (Q5122280) (← links)
- Multidimensional Global Search Using Numerical Estimations of Minimized Function Derivatives and Adaptive Nested Optimization Scheme (Q5122315) (← links)
- On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods (Q5122321) (← links)
- Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant (Q5122335) (← links)
- Generating $\alpha $-dense curves in non-convex sets to solve a class of non-smooth constrained global optimization (Q5147633) (← links)
- On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients (Q5270520) (← links)
- On an Asymptotic Property of a Simplicial Statistical Model of Global Optimization (Q5270524) (← links)
- Efficient Neighbor Search for Particle Methods on GPUs (Q5743954) (← links)
- Multidimensional global optimization using numerical estimates of objective function derivatives (Q5865327) (← links)
- Performance of convex underestimators in a branch-and-bound framework (Q5963232) (← links)
- Branch and probability bound methods in multi-objective optimization (Q5963235) (← links)
- On computational search for Nash equilibrium in hexamatrix games (Q5963237) (← links)
- Continuous global optimization on fractals through \(\alpha\)-dense curves (Q6085341) (← links)
- Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization (Q6183089) (← links)
- A new partition method for DIRECT-type algorithm based on minimax design (Q6183090) (← links)
- Numerical methods using two different approximations of space-filling curves for black-box global optimization (Q6200380) (← links)
- Utility/privacy trade-off as regularized optimal transport (Q6201932) (← links)
- Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots (Q6541382) (← links)
- A numerical method to approximate the solutions of nonlinear systems in densifiable sets (Q6582406) (← links)
