Global Descent Method for Global Optimization
DOI10.1137/090749815zbMATH Open1208.49038OpenAlexW2046515352WikidataQ57445461 ScholiaQ57445461MaRDI QIDQ3083326FDOQ3083326
Chi-Kong Ng, Duan Li, Liansheng Zhang
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090749815
global optimizationmathematical programmingnonconvex optimizationnonlinear programmingglobal descent method
Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)
Cited In (7)
- A gradually descent method for discrete global optimization
- On a new smoothing technique for non-smooth, non-convex optimization
- Global descent method for constrained continuous global optimization
- Test problem generator for unconstrained global optimization
- A modified quasisecant method for global optimization
- A novel modeling and smoothing technique in global optimization
- A novel one-parameter filled function method with an application to pathological analysis
Uses Software
This page was built for publication: Global Descent Method for Global Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083326)
