Filled function method that avoids minimizing the objective function again

DOI10.1080/02331934.2025.2577808MaRDI QIDQ7391950zbMATH OpenFDO

Authors Deqiang Qu, Youlin Shang, Guanglei Sun

Publication date 2026

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2025.2577808

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites work

• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
• A filled function method for finding a global minimizer of a function of several variables
• A filled function method for finding a global minimizer on global integer optimization
• A filled function method for minimizing control variation in constrained discrete-time optimal control problems
• A filled function which has the same local minimizer of the objective function
• A new filled function for global minimization and system of nonlinear equations
• A new filled function method for global optimization
• A new filled function method for unconstrained global optimization
• A new filled function method with two parameters for global optimization
• A new parameter-free continuously differentiable filled function algorithm for solving nonlinear equations and data fitting problems
• A new quasi-filled function method for constrained global optimization
• A novel convergent filled function algorithm for multi-dimensional global optimization
• A novel single-parameter continuously differentiable filled function for global optimization
• Discrete global optimization problems with a modified discrete filled function
• Dynamic globally concavized filled function method for continuous global optimization
• Filled function method to optimize supply chain transportation costs
• Finding global minima with an inflection point-based filled function algorithm
• First-order methods in optimization
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• New filled functions for nonsmooth global optimization
• The combination stretching function technique with simulated annealing algorithm for global optimization
• The Tunneling Algorithm for the Global Minimization of Functions
• Unsolvability of some optimization problems

This page was built for publication: Filled function method that avoids minimizing the objective function again

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391950)