Pages that link to "Item:Q5300536"

The following pages link to Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives (Q5300536):

Displaying 32 items.

• A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260) (← links)
• Optimal switching between cash-flow streams (Q684138) (← 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)
• A deterministic global optimization using smooth diagonal auxiliary functions (Q907200) (← links)
• A univariate global search working with a set of Lipschitz constants for the first derivative (Q1024739) (← links)
• Accelerations for a variety of global optimization methods (Q1315439) (← links)
• Accelerations for global optimization covering methods using second derivatives (Q1318273) (← links)
• Visualization of a statistical approximation of the Pareto front (Q1732235) (← links)
• GOSH: derivative-free global optimization using multi-dimensional space-filling curves (Q1754461) (← links)
• A deterministic method for continuous global optimization using a dense curve (Q1998159) (← links)
• Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512) (← links)
• On the search of the shape parameter in radial basis functions using univariate global optimization methods (Q2022236) (← links)
• Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework (Q2156906) (← links)
• Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives (Q2199788) (← links)
• Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms (Q2229118) (← links)
• Globally-biased disimpl algorithm for expensive global optimization (Q2250095) (← links)
• Steklov regularization and trajectory methods for univariate global optimization (Q2301181) (← links)
• Global optimization on an interval (Q2359788) (← links)
• Combining global and local strategies to optimize parameters in magnetic spacecraft control via attitude feedback (Q2420825) (← links)
• Metaheuristic vs. deterministic global optimization algorithms: the univariate case (Q2422871) (← links)
• Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics (Q2660836) (← links)
• On the Least-Squares Fitting of Data by Sinusoids (Q2958622) (← links)
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)
• On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods (Q5122321) (← links)
• On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients (Q5270520) (← links)
• Multidimensional global optimization using numerical estimates of objective function derivatives (Q5865327) (← links)
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (Q5963229) (← links)
• Performance of convex underestimators in a branch-and-bound framework (Q5963232) (← links)
• Granular sieving algorithm for selecting best n$$ n $$ parameters (Q6087609) (← links)
• Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization (Q6183089) (← links)