A new filled function method with two parameters for global optimization
From MaRDI portal
Publication:481773
DOI10.1007/s10957-013-0515-1zbMath1305.65155OpenAlexW1964400069MaRDI QIDQ481773
Yuping Wang, Fei Wei, Hong-Wei Lin
Publication date: 15 December 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0515-1
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items (13)
A new parameter free filled function for solving unconstrained global optimization problems ⋮ A new filled function for global minimization and system of nonlinear equations ⋮ MEEF: A minimum-elimination-escape function method for multimodal optimization problems ⋮ A Class of Parameter-Free Filled Functions for Unconstrained Global Optimization ⋮ Non parameter-filled function for global optimization ⋮ A new global optimization technique by auxiliary function method in a directional search ⋮ Finding global minima with an inflection point-based filled function algorithm ⋮ A novel one-parameter filled function method with an application to pathological analysis ⋮ Robust optimization for nonlinear time-delay dynamical system of \textit{dha regulon} with cost sensitivity constraint in batch culture ⋮ A new filled function method applied to unconstrained global optimization ⋮ A new filled function method for unconstrained global optimization ⋮ A criterion for an approximation global optimal solution based on the filled functions ⋮ On a new smoothing technique for non-smooth, non-convex optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem
- A new class of filled functions with one parameter for global optimization
- A parameter free filled function for unconstrained global optimization
- A filled function method for finding a global minimizer of a function of several variables
- New filled functions for nonsmooth global optimization
- A class of filled functions for finding global minimizers of a function of several variables
- Tabu search applied to global optimization
- New classes of globally convexized filled functions for global optimization
- Tabu search directed by direct search methods for nonlinear global optimization
- A tabu-search-based algorithm for continuous multiminima problems
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
- The Tunneling Algorithm for the Global Minimization of Functions
- Iterative Methods for the Localization of the Global Maximum
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Conditioning of Quasi-Newton Methods for Function Minimization
- Finding global minima with a computable filled function.
This page was built for publication: A new filled function method with two parameters for global optimization