Global Descent Method for Global Optimization

DOI10.1137/090749815zbMath1208.49038OpenAlexW2046515352WikidataQ57445461 ScholiaQ57445461MaRDI QIDQ3083326

Chi-Kong Ng, Li, Duan, Lian-Sheng 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

zbMATH Keywords

global optimizationnonconvex optimizationnonlinear programmingmathematical programmingglobal descent method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)

Related Items (6)

Global descent method for constrained continuous global optimization ⋮ Test problem generator for unconstrained global optimization ⋮ A novel modeling and smoothing technique in global optimization ⋮ A novel one-parameter filled function method with an application to pathological analysis ⋮ A modified quasisecant method for global optimization ⋮ On a new smoothing technique for non-smooth, non-convex optimization

Uses Software

• BARON
• GAMS

This page was built for publication: Global Descent Method for Global Optimization