Global one-dimensional optimization using smooth auxiliary functions
From MaRDI portal
Recommendations
Cites work
- A deterministic algorithm for global optimization
- Accelerations for a variety of global optimization methods
- An algorithm for finding the absolute extremum of a function
- Analysis of switched networks
- Convergence qualification of adaptive partition algorithms in global optimization
- Extended univariate algorithms for n-dimensional global optimization
- Global optimization
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- scientific article; zbMATH DE number 4179149 (Why is no real title available?)
- scientific article; zbMATH DE number 4099040 (Why is no real title available?)
- scientific article; zbMATH DE number 3718485 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 1058962 (Why is no real title available?)
- scientific article; zbMATH DE number 1077556 (Why is no real title available?)
- scientific article; zbMATH DE number 3370185 (Why is no real title available?)
- The alpha algorithm and the application of the cubic algorithm in case of unknown Lipschitz constant
- The cubic algorithm
Cited in
(43)- A univariate global search working with a set of Lipschitz constants for the first derivative
- A nonsmooth global optimization technique using slopes: The one-dimensional case
- Global optimization in one-dimensional case using analytically defined derivatives of objective function
- Virtuous smoothing for global optimization
- A deterministic approach to global box-constrained optimization
- An information global minimization algorithm using the local improvement technique
- A partition-based global optimization algorithm
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- On the search of the shape parameter in radial basis functions using univariate global optimization methods
- The DIRECT algorithm: 25 years later
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
- Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives
- Globally-biased disimpl algorithm for expensive global optimization
- A new global optimization technique by auxiliary function method in a directional search
- A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
- Set membership inversion and robust control from data of nonlinear systems
- On the least-squares fitting of data by sinusoids
- Rigorous constraint satisfaction for sampled linear systems
- An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- scientific article; zbMATH DE number 1058962 (Why is no real title available?)
- Univariate geometric Lipschitz global optimization algorithms
- A deterministic algorithm for global optimization
- On a global optimization algorithm for bivariate smooth functions
- Multidimensional Global Search Using Numerical Estimations of Minimized Function Derivatives and Adaptive Nested Optimization Scheme
- On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods
- On deterministic diagonal methods for solving global optimization problems with Lipschitz gradients
- Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives
- Multidimensional global optimization using numerical estimates of objective function derivatives
- One-dimensional analogue of the global optimality criterion
- Global optimization method with numerically calculated function derivatives
- A new global optimization algorithm based on space-filling curve and auxiliary function approach and its applications
- A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption
- An efficient global optimization algorithm with adaptive estimates of the local Lipschitz constants
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces
- Univariate global optimization with multiextremal non-differentiable constraints without penalty functions
- A deterministic global optimization using smooth diagonal auxiliary functions
- A new global optimization method for univariate constrained twice-differentiable NLP problems
- Lipschitz and Hölder global optimization using space-filling curves
This page was built for publication: Global one-dimensional optimization using smooth auxiliary functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290603)