Global descent methods for unconstrained global optimization
From MaRDI portal
Publication:548179
Recommendations
- Global descent method for global optimization
- Global descent method for constrained continuous global optimization
- A level value descent method for unconstrained global optimization problems
- A descent method for unconstrained optimization problems
- A multidimensional descent method for global optimization
Cites work
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 3445928 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- A class of generalized filled functions with improved computability
- A convexification method for a class of global optimization problems with applications to reliability optimization
- A filled function method for finding a global minimizer of a function of several variables
- A new filled function method for global optimization
- A novel filled function method and quasi-filled function method for global optimization
- Convexification, concavification and monotonization in global optimization
- Filled functions for unconstrained global optimization.
- Finding global minima with a computable filled function.
- Global minimum potential energy conformations of small molecules
- Handbook of global optimization
- Handbook of global optimization. Vol. 2
- Introduction to global optimization.
- New classes of globally convexized filled functions for global optimization
- On Descent from Local Minima
- Primal-relaxed dual global optimization approach
- Random tunneling by means of acceptance-rejection sampling for global optimization
- Recent developments and trends in global optimization
- Several filled functions with mitigators.
- Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
- The Tunneling Algorithm for the Global Minimization of Functions
- The globally convexized filled functions for global optimization
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(17)- Greatest descent algorithms in unconstrained optimization
- The theories of a novel filled function method for non-smooth global optimization
- On the global optimization properties of finite-difference local descent algorithms
- Extended global convergence framework for unconstrained optimization
- Global descent method for global optimization
- Global descent method for constrained continuous global optimization
- A multi-stage descent algorithm for discrete and continuous optimization applied to truss structures optimal design
- A level value descent method for unconstrained global optimization problems
- Testing the topographical global initialization strategy in the framework of an unconstrained optimization method
- Gradient-only approaches to avoid spurious local minima in unconstrained optimization
- A novel modeling and smoothing technique in global optimization
- A multidimensional descent method for global optimization
- Double descent and intermittent color diffusion for landscape exploration
- On a new smoothing technique for non-smooth, non-convex optimization
- scientific article; zbMATH DE number 5631038 (Why is no real title available?)
- A modified quasisecant method for global optimization
- A gradually descent method for discrete global optimization
This page was built for publication: Global descent methods for unconstrained global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548179)
