New classes of globally convexized filled functions for global optimization
From MaRDI portal
Recommendations
Cited in
(39)- A new parameter free filled function for solving unconstrained global optimization problems
- Polynomial-filled function algorithm for unconstrained global optimization problems
- A Class of Parameter-Free Filled Functions for Unconstrained Global Optimization
- An integral function and vector sequence method for unconstrained global optimization
- A filled function method for finding a global minimizer on global integer optimization
- A gradually descent method for discrete global optimization
- A new auxiliary function method for general constrained global optimization
- Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems
- A new filled function method for unconstrained global optimization
- Global descent methods for unconstrained global optimization
- A filled function method for global optimization with inequality constraints
- A new parameter-free continuously differentiable filled function algorithm for solving nonlinear equations and data fitting problems
- Unification of filled function and tunnelling function in global optimization
- A revised cut-peak function method for box constrained continuous global optimization
- A integral filter algorithm for unconstrained global optimization
- A filled penalty function method for solving constrained optimization problems
- Discrete global optimization problems with a modified discrete filled function
- A filled function method for constrained global optimization
- New modified function method for global optimization
- Minimum-time spacecraft attitude motion planning using objective alternation in derivative-free optimization
- A new filled function method for constrained nonlinear equations
- A new filled function method with two parameters for global optimization
- Modified Filled Function Method for Resolving Nonlinear Integer Programming Problem
- A filling function method for unconstrained global optimization
- Finding global minima with an inflection point-based filled function algorithm
- Global optimization of protein-peptide docking by a filling function method
- Global optimization based on local searches
- Global optimization based on local searches
- A novel filled function method and quasi-filled function method for global optimization
- Two-parameters quasi-filled function algorithm for nonlinear integer programming
- A new filled function method for global optimization
- A new filled function for global minimization and system of nonlinear equations
- An approach to solve local and global optimization problems based on exact objective filled penalty functions
- A class of one-parameter filled functions with the same local minima as the objective function for global optimization problems
- New global optimization methods for ship design problems
- scientific article; zbMATH DE number 5926301 (Why is no real title available?)
- scientific article; zbMATH DE number 5926958 (Why is no real title available?)
- Simple transformation functions for finding better minima
- A novel one-parameter filled function method with an application to pathological analysis
This page was built for publication: New classes of globally convexized filled functions for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812075)
