Univariate global optimization with multiextremal non-differentiable constraints without penalty functions
From MaRDI portal
Publication:853549
DOI10.1007/S10589-005-3906-XzbMath1121.90104arXiv1107.5269OpenAlexW2129650095MaRDI QIDQ853549
Publication date: 17 November 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.5269
Related Items (3)
A Search Algorithm for the Global Extremum of a Discontinuous Function ⋮ Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
Cites Work
- Convergence rates of a global optimization algorithm
- Global one-dimensional optimization using smooth auxiliary functions
- Random linkage: A family of acceptance/rejection algorithms for global sation
- A method for converting a class of univariate functions into d. c. functions
- On the role of continuously differentiable exact penalty functions in constrained global optimization
- Handbook of global optimization
- Developments in global optimization. Proceedings of the 3rd workshop, Szeged, Hungary, December 10--14, 1995
- Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- A deterministic algorithm for global optimization
- On the convergence of the P-algorithm for one-dimensional global optimization of smooth functions
- Value-estimation function method for constrained global optimization
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- An adaptive stochastic global optimization algorithm for one-dimensional functions
- An algorithm for solving global optimization problems with nonlinear constraints
- An improved univariate global optimization algorithm with improved linear lower bounding functions
- State of the art in global optimization: computational methods and applications. Papers of the conference, Princeton, NJ, USA, April 28--30, 1995
- Thevenin decomposition and large-scale optimization
- Test Problems for Lipschitz Univariate Global Optimization with Multiextremal Constraints
- Minimization of multiextremal functions under nonconvex constraints
- Numerical Optimization
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
- An algorithm for finding the absolute extremum of a function
- Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions
- On convergence of "divide the best" global optimization algorithms
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Univariate global optimization with multiextremal non-differentiable constraints without penalty functions
