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

Chang Yong Song, Jongsoo Lee

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In the context of approximate optimization, the most extensively used tools are the response surface method (RSM) and the moving least squares method (MLSM). Since traditional RSMs and MLSMs are generally described by second-order polynomials, approximate optimal solutions can, at times, be infeasible in cases where highly nonlinear and/or nonconvex constraint functions are to be approximated. This paper explores the development of a new MLSM-based meta-model that ensures the constraint feasibility of an approximate optimal solution. A constraint-feasible MLSM, referred to as CF-MLSM, makes approximate optimization possible for all of the convergence processes, regardless of the multimodality/nonlinearity in the constraint function. The usefulness of the proposed approach is verified by examining various nonlinear function optimization problems.

Original languageEnglish
Pages (from-to)163-188
Number of pages26
JournalComputational Optimization and Applications
Volume50
Issue number1
DOIs
Publication statusPublished - 2011 Sep 1

Fingerprint

Moving Least Squares
Response Surface
Least Square Method
Optimization
Optimal Solution
Response Surface Method
Multimodality
Function Optimization
Nonlinear Optimization
Metamodel
Nonlinear Function
Polynomials
Nonlinearity
Optimization Problem
Polynomial

All Science Journal Classification (ASJC) codes

  • Control and Optimization
  • Computational Mathematics
  • Applied Mathematics

Cite this

@article{80d778f14a234b9cbf4fa6327d2a4b74,
title = "A realization of constraint feasibility in a moving least squares response surface based approximate optimization",
abstract = "In the context of approximate optimization, the most extensively used tools are the response surface method (RSM) and the moving least squares method (MLSM). Since traditional RSMs and MLSMs are generally described by second-order polynomials, approximate optimal solutions can, at times, be infeasible in cases where highly nonlinear and/or nonconvex constraint functions are to be approximated. This paper explores the development of a new MLSM-based meta-model that ensures the constraint feasibility of an approximate optimal solution. A constraint-feasible MLSM, referred to as CF-MLSM, makes approximate optimization possible for all of the convergence processes, regardless of the multimodality/nonlinearity in the constraint function. The usefulness of the proposed approach is verified by examining various nonlinear function optimization problems.",
author = "Song, {Chang Yong} and Jongsoo Lee",
year = "2011",
month = "9",
day = "1",
doi = "10.1007/s10589-009-9312-z",
language = "English",
volume = "50",
pages = "163--188",
journal = "Computational Optimization and Applications",
issn = "0926-6003",
publisher = "Springer Netherlands",
number = "1",

}

A realization of constraint feasibility in a moving least squares response surface based approximate optimization. / Song, Chang Yong; Lee, Jongsoo.

In: Computational Optimization and Applications, Vol. 50, No. 1, 01.09.2011, p. 163-188.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Song, Chang Yong

AU - Lee, Jongsoo

PY - 2011/9/1

Y1 - 2011/9/1

N2 - In the context of approximate optimization, the most extensively used tools are the response surface method (RSM) and the moving least squares method (MLSM). Since traditional RSMs and MLSMs are generally described by second-order polynomials, approximate optimal solutions can, at times, be infeasible in cases where highly nonlinear and/or nonconvex constraint functions are to be approximated. This paper explores the development of a new MLSM-based meta-model that ensures the constraint feasibility of an approximate optimal solution. A constraint-feasible MLSM, referred to as CF-MLSM, makes approximate optimization possible for all of the convergence processes, regardless of the multimodality/nonlinearity in the constraint function. The usefulness of the proposed approach is verified by examining various nonlinear function optimization problems.

AB - In the context of approximate optimization, the most extensively used tools are the response surface method (RSM) and the moving least squares method (MLSM). Since traditional RSMs and MLSMs are generally described by second-order polynomials, approximate optimal solutions can, at times, be infeasible in cases where highly nonlinear and/or nonconvex constraint functions are to be approximated. This paper explores the development of a new MLSM-based meta-model that ensures the constraint feasibility of an approximate optimal solution. A constraint-feasible MLSM, referred to as CF-MLSM, makes approximate optimization possible for all of the convergence processes, regardless of the multimodality/nonlinearity in the constraint function. The usefulness of the proposed approach is verified by examining various nonlinear function optimization problems.

UR - http://www.scopus.com/inward/record.url?scp=79961003285&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79961003285&partnerID=8YFLogxK

U2 - 10.1007/s10589-009-9312-z

DO - 10.1007/s10589-009-9312-z

M3 - Article

VL - 50

SP - 163

EP - 188

JO - Computational Optimization and Applications

JF - Computational Optimization and Applications

SN - 0926-6003

IS - 1

ER -