The globally convexized filled functions for global optimization
From MaRDI portal
Publication:1813720
DOI10.1016/0096-3003(90)90114-IzbMath0752.65052OpenAlexW2020814925MaRDI QIDQ1813720
Publication date: 25 June 1992
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0096-3003(90)90114-i
algorithmnumerical examplesunconstrained global optimizationglobally convexized filled functionstochastic stopping rules
Related Items (50)
Global descent method for constrained continuous global optimization ⋮ Finding global minima with a new dynamical evolutionary algorithm ⋮ An augmented filled function for global nonlinear integer optimization ⋮ Continuous action set learning automata for stochastic optimization ⋮ A novel filled function method and quasi-filled function method for global optimization ⋮ Two-parameters quasi-filled function algorithm for nonlinear integer programming ⋮ Unification of filled function and tunnelling function in global optimization ⋮ A new discrete filled function algorithm for discrete global optimization ⋮ A parallel global optimization algorithm for rational separable- factorable functions ⋮ A integral filter algorithm for unconstrained global optimization ⋮ Simple transformation functions for finding better minima ⋮ Modified T-F function method for finding global minimizer on unconstrained optimization ⋮ A new filled function applied to global optimization. ⋮ Finding more and more solutions of a system of nonlinear equations ⋮ A filled function method for constrained global optimization ⋮ A new filled function method for global optimization ⋮ A direct search algorithm for global optimization ⋮ Some applications of a polynomial inequality to global optimization ⋮ A new constructing auxiliary function method for global optimization ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ Finding discrete global minima with a filled function for integer programming ⋮ A new auxiliary function method for general constrained global optimization ⋮ A filled function method dominated by filter for nonlinearly global optimization ⋮ New filled functions for nonsmooth global optimization ⋮ An integral function and vector sequence method for unconstrained global optimization ⋮ A one-parameter filled function for nonsmooth global optimization and its application ⋮ Global descent methods for unconstrained global optimization ⋮ A new filled function method for unconstrained global optimization ⋮ The combination stretching function technique with simulated annealing algorithm for global optimization ⋮ A filled function method for finding a global minimizer on global integer optimization ⋮ A smoothing method of global optimization that preserves global minima ⋮ A new filled function method for constrained nonlinear equations ⋮ A gradually descent method for discrete global optimization ⋮ New modified function method for global optimization ⋮ Modified Filled Function Method for Resolving Nonlinear Integer Programming Problem ⋮ A class of generalized filled functions with improved computability ⋮ Finding global minimizer with one-parameter filled function on unconstrained global optimization ⋮ A modified tunneling function method for non-smooth global optimization and its application in artificial neural network ⋮ A criterion for an approximation global optimal solution based on the filled functions ⋮ The filled function transformations for constrained global optimization ⋮ Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions ⋮ A cut-peak function method for global optimization ⋮ A parallel computing scheme for minimizing a class of large scale functions ⋮ An efficient dynamical evolutionary algorithm for global optimization ⋮ A continuous approach to nonlinear integer programming ⋮ An efficient algorithm for range computation of polynomials using the Bernstein form ⋮ A class of filled functions for box constrained continuous global optimization ⋮ Filled functions for unconstrained global optimization ⋮ Revised filled function methods for global optimization. ⋮ A computable filled function used for global minimization
Cites Work
- Global optimization and stochastic differential equations
- A filled function method for finding a global minimizer of a function of several variables
- A class of filled functions for finding global minimizers of a function of several variables
- Optimal choice of linear interval extension
- Global optimization using interval analysis - the multi-dimensional case
- Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
- A parallel computing scheme for minimizing a class of large scale functions
- A stochastic method for global optimization
- Inclusion functions and global optimization
- The Tunneling Algorithm for the Global Minimization of Functions
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The globally convexized filled functions for global optimization
