.png){kind=icon}
Return
How to solve a semi-infinite optimization problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2012.06.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
After an introduction to main ideas of semi-infinite optimization, this article surveys recent developments in theory and numerical methods for standard and generalized semi-infinite optimization problems. Particular attention is paid to connections with mathematical programs with complementarity constraints, lower level Wolfe duality, semi-smooth approaches, as well as branch and bound techniques in adaptive convexification procedures. A section on recent genericity results includes a discussion of the symmetry effect in generalized semi-infinite optimization. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Semi-infinite optimization
Design centering
Robust optimization
Adaptive convexification
Genericity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave
ShareSaveShareSave
View more