A realization of constraint feasibility in a moving least squares response surface based approximate optimization

DOI10.1007/s10589-009-9312-zzbMath1228.90160OpenAlexW2093005208MaRDI QIDQ645542

Chang Yong Song, Jong Soo Lee

Publication date: 8 November 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-009-9312-z

zbMATH Keywords

approximate optimizationconstraint feasibilityconstraint-feasible MLSM (CF-MLSM)moving least squares method (MLSM)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An enhancement of constraint feasibility in BPN based approximate optimization
• Design and analysis of computer experiments. With comments and a rejoinder by the authors
• GA based meta-modeling of BPN architecture for constrained approximate optimization
• An Introduction to Moving Least Squares Meshfree Methods
• A duality theorem for non-linear programming
• Surfaces Generated by Moving Least Squares Methods
• Simultaneous surface and tetrahedron mesh adaptation using mesh-free techniques
• Metamodels for computer-based engineering design: Survey and recommendations