Pages that link to "Item:Q1321408"

The following pages link to Lipschitzian optimization without the Lipschitz constant (Q1321408):

Displaying 50 items.

• Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients (Q5081778) (← links)
• Combined Global and Local Search for Optimization with Gaussian Process Models (Q5084673) (← links)
• Escaping local minima with local derivative-free methods: a numerical investigation (Q5093686) (← links)
• Zero-modified power series distribution and its Hurdle distribution version (Q5106891) (← links)
• GPU parameter tuning for tall and skinny dense linear least squares problems (Q5113719) (← links)
• Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization (Q5122272) (← links)
• Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant (Q5122335) (← links)
• Bayesian model comparison for compartmental models with applications in positron emission tomography (Q5128988) (← links)
• Penalized multidimensional fitting for protein movement detection (Q5138739) (← links)
• (Q5148932) (← links)
• Black-Box Optimization: Methods and Applications (Q5153493) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• A Fuzzy Hybrid Sequential Design Strategy for Global Surrogate Modeling of High-Dimensional Computer Experiments (Q5254481) (← links)
• Global Optimization of Interplanetary Transfers with Deep Space Maneuvers Using Differential Algebra (Q5270069) (← links)
• On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients (Q5270520) (← links)
• Convergence rate of a simulated annealing algorithm with noisy observations (Q5381109) (← links)
• Center-based l1–clustering method (Q5494418) (← links)
• Efficient numerical methods for the optimisation of large kinetic reaction mechanisms (Q5872061) (← links)
• Simulation optimization: a review of algorithms and applications (Q5919176) (← links)
• Global optimization based on local searches (Q5920293) (← links)
• Global optimization based on local searches (Q5925165) (← links)
• Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738) (← links)
• Indistinguishable states. I: Pefect model scenario. (Q5942847) (← links)
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (Q5963229) (← links)
• Type I multivariate zero‐inflated COM–Poisson regression model (Q6068483) (← links)
• Complex portfolio selection via convex mixed‐integer quadratic programming: a survey (Q6070970) (← links)
• Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization (Q6074062) (← links)
• Granular sieving algorithm for selecting best n$$ n $$ parameters (Q6087609) (← links)
• Hermite least squares optimization: a modification of BOBYQA for optimization with limited derivative information (Q6088560) (← links)
• Branch-and-Model: a derivative-free global optimization algorithm (Q6097758) (← links)
• Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach (Q6123558) (← links)
• Bridging formal methods and machine learning with model checking and global optimisation (Q6151625) (← links)
• Continuous models combining slacks-based measures of efficiency and super-efficiency (Q6161235) (← links)
• A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps (Q6173797) (← 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)
• Matching pursuit with unbounded parameter domains (Q6184992) (← links)
• Adaptive confidence bound based Bayesian optimization via potentially optimal Lipschitz conditions (Q6193911) (← links)
• Numerical methods using two different approximations of space-filling curves for black-box global optimization (Q6200380) (← links)
• An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework (Q6200381) (← links)
• Reference-point-based branch and bound algorithm for multiobjective optimization (Q6203550) (← links)
• A partition-based convergence framework for population-based optimization algorithms (Q6492619) (← links)
• A new reliable operating region design method (Q6534870) (← links)
• Supervisory adaptive safety control for uncertain nonlinear systems (Q6554310) (← links)
• Efficient constitutive parameter identification through optimisation-based techniques: a comparative analysis and novel composite Bayesian optimisation strategy (Q6557802) (← links)
• A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets (Q6568951) (← links)
• Global solutions to nonconvex problems by evolution of Hamilton-Jacobi PDEs (Q6575280) (← links)
• DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization (Q6599982) (← links)
• Certified multifidelity zeroth-order optimization (Q6645132) (← links)
• Quantum phases of hardcore bosons with repulsive dipolar density-density interactions on two-dimensional lattices (Q6649162) (← links)