Global one-dimensional optimization using smooth auxiliary functions
From MaRDI portal
Publication:1290603
DOI10.1007/BF01584848zbMath0920.90133OpenAlexW1971851272MaRDI QIDQ1290603
Publication date: 3 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584848
Related Items (32)
Rigorous constraint satisfaction for sampled linear systems ⋮ Univariate global optimization with multiextremal non-differentiable constraints without penalty functions ⋮ Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints ⋮ A Deterministic Algorithm for Global Optimization ⋮ Set membership inversion and robust control from data of nonlinear systems ⋮ Virtuous smoothing for global optimization ⋮ On the Least-Squares Fitting of Data by Sinusoids ⋮ Global optimization method with numerically calculated function derivatives ⋮ Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives ⋮ A deterministic approach to global box-constrained optimization ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ Lipschitz gradients for global optimization in a one-point-based partitioning scheme ⋮ 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 ⋮ An information global minimization algorithm using the local improvement technique ⋮ A partition-based global optimization algorithm ⋮ A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints ⋮ A new global optimization method for univariate constrained twice-differentiable NLP problems ⋮ Globally-biased disimpl algorithm for expensive global optimization ⋮ Lipschitz and Hölder global optimization using space-filling curves ⋮ 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 ⋮ 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 ⋮ An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial ⋮ Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces ⋮ Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint ⋮ A univariate global search working with a set of Lipschitz constants for the first derivative ⋮ Multidimensional global optimization using numerical estimates of objective function derivatives ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients ⋮ An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
Cites Work
- Extended univariate algorithms for \(n\)-dimensional global optimization
- The cubic algorithm
- Convergence qualification of adaptive partition algorithms in global optimization
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- Accelerations for a variety of global optimization methods
- The alpha algorithm and the application of the cubic algorithm in case of unknown Lipschitz constant
- A deterministic algorithm for global optimization
- Analysis of switched networks
- An algorithm for finding the absolute extremum of a function
- Global optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Global one-dimensional optimization using smooth auxiliary functions
