A realization of constraint feasibility in a moving least squares response surface based approximate optimization
From MaRDI portal
Publication:645542
DOI10.1007/s10589-009-9312-zzbMath1228.90160MaRDI QIDQ645542
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
approximate optimization; constraint feasibility; constraint-feasible MLSM (CF-MLSM); moving least squares method (MLSM)
90C59: Approximation methods and heuristics in mathematical programming
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item