Global descent method for constrained continuous global optimization
From MaRDI portal
Recommendations
- Global descent methods for unconstrained global optimization
- Global descent method for global optimization
- A multidimensional descent method for global optimization
- Constrained global optimization using a new exact penalty function
- Dynamic globally concavized filled function method for continuous global optimization
Cites work
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- A filled function method applied to nonsmooth constrained global optimization
- A filled function method for finding a global minimizer of a function of several variables
- A filled function method with one parameter for unconstrained global optimization
- A new auxiliary function method for general constrained global optimization
- A new extension of Piyavskii's method to Hölder functions of several variables
- A new filled function algorithm for constrained global optimization problems
- A new filled function method for unconstrained global optimization
- A numerical comparison of some modified controlled random search algorithms
- A one-parameter filled function method applied to nonsmooth constrained global optimization
- A sequential convexification method (SCM) for continuous global optimization
- CARTopt: a random search method for nonsmooth unconstrained optimization
- Convex analysis and global optimization
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Extension of Piyavskii's algorithm to continuous global optimization
- Filled functions for unconstrained global optimization.
- Global descent method for global optimization
- Global descent methods for unconstrained global optimization
- Introduction to global optimization.
- Optimization by simulated annealing
- The Tunneling Algorithm for the Global Minimization of Functions
- The globally convexized filled functions for global optimization
- The impelling function method applied to global optimization
Cited in
(16)- Existence and discrete approximation for optimization problems governed by fractional differential equations
- A deterministic method for continuous global optimization using a dense curve
- scientific article; zbMATH DE number 2068062 (Why is no real title available?)
- A gradually descent method for discrete global optimization
- On a new smoothing technique for non-smooth, non-convex optimization
- Continuous GRASP with a local active-set method for bound-constrained global optimization
- Global descent methods for unconstrained global optimization
- A revised cut-peak function method for box constrained continuous global optimization
- A sequential convexification method (SCM) for continuous global optimization
- A local search method for continuous global optimization
- Global descent method for global optimization
- A multidimensional descent method for global optimization
- A new global optimization technique by auxiliary function method in a directional search
- Continuous global optimization through the generation of parametric curves
- An efficient algorithm for large scale global optimization of continuous functions
- Parametric method for global optimization
This page was built for publication: Global descent method for constrained continuous global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q278323)