A one-parameter filled function for nonsmooth global optimization and its application
From MaRDI portal
Publication:545434
DOI10.1007/s11424-010-7199-5zbMath1222.90045OpenAlexW2077284686MaRDI QIDQ545434
Ying Zhang, Lian-Sheng Zhang, Ying-Tao Xu
Publication date: 22 June 2011
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-010-7199-5
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Fruit nutritive factor network
- An interval version of Shubert's iterative method for the localization of the global maximum
- Newton's method for convex programming and Tschebyscheff approximation
- Global interval methods for local nonsmooth optimization
- The globally convexized filled functions for global optimization
- Revised filled function methods for global optimization.
- The Cutting-Plane Method for Solving Convex Programs
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Optimization and nonsmooth analysis
- The Tunneling Algorithm for the Global Minimization of Functions
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A new filled function method for global optimization
This page was built for publication: A one-parameter filled function for nonsmooth global optimization and its application
