New filled functions for nonsmooth global optimization

DOI10.1016/j.apm.2008.10.015zbMath1205.90236MaRDI QIDQ965609

Ying Zhang, Lian-Sheng Zhang, Ying-Tao Xu

Publication date: 24 April 2010

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2008.10.015

zbMATH Keywords

global optimization; nonsmooth optimization; local minimizer; global minimizer; filled function

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C56: Derivative-free methods and methods using generalized derivatives

Related Items

A Class of Parameter-Free Filled Functions for Unconstrained Global Optimization, A new filled function method for unconstrained global optimization, A novel convergent filled function algorithm for multi-dimensional global optimization, A novel approach for solving nonsmooth optimization problems with application to nonsmooth equations, A new filled function method with two parameters for global optimization, Continuous global optimization through the generation of parametric curves, A direct search algorithm for global optimization, Filled function method to optimize supply chain transportation costs, A modified tunneling function method for non-smooth global optimization and its application in artificial neural network, A new global optimization technique by auxiliary function method in a directional search

Cites Work

• Finding global minimizer with one-parameter filled function on unconstrained global optimization
• An interval version of Shubert's iterative method for the localization of the global maximum
• Global interval methods for local nonsmooth optimization
• A nonsmooth global optimization technique using slopes: The one-dimensional case
• A trust-region-approach for solving a parameter estimation problem from the biotechnology area
• New modified function method for global optimization
• The impact of accelerating tools on the interval subdivision algorithm for global optimization
• An electromagnetism-like mechanism for global optimization
• The globally convexized filled functions for global optimization
• Revised filled function methods for global optimization.
• Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
• The Cutting-Plane Method for Solving Convex Programs
• 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
• Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
• A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
• A new filled function method for global optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item