Univariate global optimization with multiextremal non-differentiable constraints without penalty functions
From MaRDI portal
Publication:853549
Abstract: This paper proposes a new algorithm for solving constrained global optimization problems where both the objective function and constraints are one-dimensional non-differentiable multiextremal Lipschitz functions. Multiextremal constraints can lead to complex feasible regions being collections of isolated points and intervals having positive lengths. The case is considered where the order the constraints are evaluated is fixed by the nature of the problem and a constraint is defined only over the set where the constraint is satisfied. The objective function is defined only over the set where all the constraints are satisfied. In contrast to traditional approaches, the new algorithm does not use any additional parameter or variable. All the constraints are not evaluated during every iteration of the algorithm providing a significant acceleration of the search. The new algorithm either finds lower and upper bounds for the global optimum or establishes that the problem is infeasible. Convergence properties and numerical experiments showing a nice performance of the new method in comparison with the penalty approach are given.
Recommendations
- Univariate algorithms for solving global optimization problems with multiextremal non-differentiable constraints
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- An algorithm for solving global optimization problems with nonlinear constraints
- Test problems for Lipschitz univariate global optimization with multiextremal constraints
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
Cites work
- 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 757681 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 970349 (Why is no real title available?)
- A deterministic algorithm for global optimization
- A method for converting a class of univariate functions into d. c. functions
- An adaptive stochastic global optimization algorithm for one-dimensional functions
- An algorithm for finding the absolute extremum of a function
- An algorithm for solving global optimization problems with nonlinear constraints
- An improved univariate global optimization algorithm with improved linear lower bounding functions
- Convergence rates of a global optimization algorithm
- Developments in global optimization. Proceedings of the 3rd workshop, Szeged, Hungary, December 10--14, 1995
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Global one-dimensional optimization using smooth auxiliary functions
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Handbook of global optimization
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions
- Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions
- Minimization of multiextremal functions under nonconvex constraints
- Numerical Optimization
- On convergence of "divide the best" global optimization algorithms
- On the convergence of the P-algorithm for one-dimensional global optimization of smooth functions
- On the role of continuously differentiable exact penalty functions in constrained global optimization
- Random linkage: A family of acceptance/rejection algorithms for global sation
- State of the art in global optimization: computational methods and applications. Papers of the conference, Princeton, NJ, USA, April 28--30, 1995
- Test problems for Lipschitz univariate global optimization with multiextremal constraints
- Thevenin decomposition and large-scale optimization
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
- Value-estimation function method for constrained global optimization
Cited in
(7)- A Search Algorithm for the Global Extremum of a Discontinuous Function
- A new global optimization method for univariate constrained twice-differentiable NLP problems
- Solving constrained global optimization problems without penalty parameters
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- Global optimization method of multivariate non-Lipschitz functions using tangent minorants
- Univariate algorithms for solving global optimization problems with multiextremal non-differentiable constraints
- Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives
This page was built for publication: Univariate global optimization with multiextremal non-differentiable constraints without penalty functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853549)
