A filled function method for global optimization with inequality constraints
From MaRDI portal
Publication:725788
DOI10.1007/s40314-016-0407-8zbMath1433.90125OpenAlexW2562535396MaRDI QIDQ725788
Yuping Wang, Yuelin Gao, Xiaoli Wang, Hong-Wei Lin
Publication date: 2 August 2018
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-016-0407-8
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (4)
A new filled function for global minimization and system of nonlinear equations ⋮ Non parameter-filled function for global optimization ⋮ A novel convergent filled function algorithm for multi-dimensional global optimization ⋮ On a new smoothing technique for non-smooth, non-convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem
- A continuously differentiable filled function method for global optimization
- A new filled function algorithm for constrained global optimization problems
- A filled function method applied to nonsmooth constrained global optimization
- A filled function method for finding a global minimizer of a function of several variables
- A filled function method for constrained global optimization
- A multi-start global minimization algorithm with dynamic search trajectories
- A collection of test problems for constrained global optimization algorithms
- Handbook of test problems in local and global optimization
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- The barrier attribute of filled functions.
- New classes of globally convexized filled functions for global optimization
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
- An algorithm for finding the global maximum of a multimodal, multivariate function
- The Tunneling Algorithm for the Global Minimization of Functions
- Iterative Methods for the Localization of the Global Maximum
- A new filled function method for global optimization
- Finding global minima with a computable filled function.
This page was built for publication: A filled function method for global optimization with inequality constraints
