An interior semi-infinite programming method (Q1093544): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Globally convergent methods for semi-infinite programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3659045 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A projected lagrangian algorithm for semi-infinite programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A recursive quadratic programming algorithm for semi-infinite optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3939127 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3668370 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4191529 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear Chebyshev approximation without Chebyshev sets / rank | |||
Normal rank | |||
Revision as of 12:58, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An interior semi-infinite programming method |
scientific article |
Statements
An interior semi-infinite programming method (English)
0 references
1988
0 references
A new method for semi-infinite programming problems with convex constraints is presented. The method generates a sequence of feasible points whose cluster points are solutions of the original problem. No maximization over the index set is required. Some computational results are also presented.
0 references
discretization
0 references
convex constraints
0 references
sequence of feasible points
0 references
cluster points
0 references
