Global convergence of a robust smoothing SQP method for semi-infinite programming (Q2370033): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10957-006-9049-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002833707 / rank | |||
Normal rank | |||
Revision as of 21:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global convergence of a robust smoothing SQP method for semi-infinite programming |
scientific article |
Statements
Global convergence of a robust smoothing SQP method for semi-infinite programming (English)
0 references
21 June 2007
0 references
Semi-infinite optimization problems are mathematical programs with finite dimensional decision variable and possibly infinitely many inequality constraints. One way to reformulate them as a nonlinear programming problem is by replacing the constraints via an integral function. The inherent nonsmoothness of semi-infinite programming then entails the nonsmoothness of the integral constraint. The article presents a smoothing SQP method for this reformulation, where the quadratic subproblems are solvable in each iteration. Under mild conditions global convergence of the algorithm is established, and preliminary numerical results are given.
0 references
smoothing SQP method
0 references
semi-infinite programming
0 references
integral function
0 references
global convergence
0 references
