A novel filled function method and quasi-filled function method for global optimization

DOI10.1007/s10589-005-3077-9zbMath1121.90105MaRDI QIDQ853545

Yang, Xinmin, H. W. Joseph Lee, Lian-Sheng Zhang, Zhi-You Wu

Publication date: 17 November 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-005-3077-9

zbMATH Keywords

global optimization; filled function; quasi-filled function

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

Related Items

A new auxiliary function method for general constrained global optimization, A new filled function method for unconstrained global optimization, Optimization methods for mixed integer weakly concave programming problems, Global optimality conditions and optimization methods for polynomial programming problems, Global descent methods for unconstrained global optimization, A new class of filled functions with one parameter for global optimization, A parameter free filled function for unconstrained global optimization, Discrete global optimization problems with a modified discrete filled function, A system of nonsmooth equations solver based upon subgradient method, A filled function method for constrained global optimization, A filled function method for nonlinear equations

Cites Work

• A filled function method for finding a global minimizer of a function of several variables
• Global optimization techniques for mixed complementarity problems
• Recent developments and trends in global optimization
• New modified function method for global optimization
• New classes of globally convexized filled functions for global optimization
• The globally convexized filled functions for global optimization
• Several filled functions with mitigators.
• Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
• A new filled function method for global optimization
• Finding global minima with a computable filled function.
• Filled functions for unconstrained global optimization.
• A class of generalized filled functions with improved computability
• Unnamed Item
• Unnamed Item