A revised cut-peak function method for box constrained continuous global optimization
From MaRDI portal
Publication:990665
DOI10.1016/j.amc.2007.04.045zbMath1193.90173MaRDI QIDQ990665
Zheng-Hai Huang, Xin-He Miao, Ping Wang
Publication date: 1 September 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.04.045
90C26: Nonconvex programming, global optimization
Related Items
Reducing transformation and global optimization, A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search, A note on ``A continuous approach to nonlinear integer programming, MEEF: A minimum-elimination-escape function method for multimodal optimization problems
Cites Work
- A filled function method for finding a global minimizer on global integer optimization
- A filled function method for finding a global minimizer of a function of several variables
- A class of filled functions for finding global minimizers of a function of several variables
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- A new filled function applied to global optimization.
- Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms
- New classes of globally convexized filled functions for global optimization
- A continuous approach to nonlinear integer programming
- A computable filled function used for global minimization
- A class of filled functions for box constrained continuous global optimization
- The Tunneling Algorithm for the Global Minimization of Functions
- A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution
- Finding global minima with a computable filled function.
- Filled functions for unconstrained global optimization.
