The theories of a novel filled function method for non-smooth global optimization

DOI10.1007/978-3-030-57602-8_34zbMath1485.90100OpenAlexW3048208120MaRDI QIDQ2039687

Shuo Li, You-lin Shang, Wei-Xiang Wang

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_34

zbMATH Keywords

filled function methodnonlinear equationsglobal minimizernon-smooth global optimizationNCP problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• Unnamed Item
• Global descent methods for unconstrained global optimization
• A class of filled functions for finding global minimizers of a function of several variables
• New modified function method for global optimization
• Optimization and nonsmooth analysis
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• A new filled function method for global optimization
• A new filled function method for unconstrained global optimization
• Filled functions for unconstrained global optimization.

This page was built for publication: The theories of a novel filled function method for non-smooth global optimization