Global descent methods for unconstrained global optimization
From MaRDI portal
Publication:548179
DOI10.1007/s10898-010-9587-8zbMath1228.90089OpenAlexW2088448568WikidataQ57445458 ScholiaQ57445458MaRDI QIDQ548179
Lian-Sheng Zhang, Li, Duan, Zhi-You Wu
Publication date: 28 June 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9587-8
global optimizationlocal searchnon-convex optimizationglobal descent methodmodified function approach
Related Items
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 novel modeling and smoothing technique in global optimization ⋮ The theories of a novel filled function method for non-smooth global optimization ⋮ A modified quasisecant method for global optimization ⋮ On a new smoothing technique for non-smooth, non-convex optimization
Cites Work
- A novel filled function method and quasi-filled function method for global optimization
- A filled function method for finding a global minimizer of a function of several variables
- Random tunneling by means of acceptance-rejection sampling for global optimization
- Global minimum potential energy conformations of small molecules
- Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
- Primal-relaxed dual global optimization approach
- Handbook of global optimization
- Recent developments and trends in global optimization
- Handbook of global optimization. Vol. 2
- New classes of globally convexized filled functions for global optimization
- The globally convexized filled functions for global optimization
- Several filled functions with mitigators.
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
- The Tunneling Algorithm for the Global Minimization of Functions
- On Descent from Local Minima
- A new filled function method for global optimization
- Introduction to global optimization.
- Finding global minima with a computable filled function.
- Filled functions for unconstrained global optimization.
- A class of generalized filled functions with improved computability
- A convexification method for a class of global optimization problems with applications to reliability optimization
- Convexification, concavification and monotonization in global optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
