A cut-peak function method for global optimization

DOI10.1016/j.cam.2008.10.069zbMath1166.65030OpenAlexW2062252896MaRDI QIDQ1026439

Yuncheng Wang, Weiwu Fang, Tianjiao Wu

Publication date: 25 June 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2008.10.069

zbMATH Keywords

algorithmglobal optimizationnumerical examplessmoothing techniquecut-peak functionbox constrained minimization problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Filled function method to optimize supply chain transportation costs, MEEF: A minimum-elimination-escape function method for multimodal optimization problems, On a new smoothing technique for non-smooth, non-convex optimization, A filled function which has the same local minimizer of the objective function

Cites Work

• Algorithms with adaptive smoothing for finite minimax problems
• A class of filled functions for finding global minimizers of a function of several variables
• A new filled function applied to global optimization.
• The globally convexized filled functions for global optimization
• A filled function method for global optimization
• Minimization of functions having Lipschitz continuous first partial derivatives
• Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
• The Tunneling Algorithm for the Global Minimization of Functions
• 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
• Unnamed Item
• Unnamed Item