A SQP method for inequality constrained optimization. (Q1611084): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An algorithm for solving linearly constrained minimax problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A robust sequential quadratic programming method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Robust recursive quadratic programming algorithm model with global and superlinear convergence properties / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2712459 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A modified SQP method and its global convergence / rank | |||
Normal rank | |||
Revision as of 14:06, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A SQP method for inequality constrained optimization. |
scientific article |
Statements
A SQP method for inequality constrained optimization. (English)
0 references
20 August 2002
0 references
SQP method
0 references
global convergence
0 references
inequality constrained optimization
0 references
nondifferentiable exact penalty function
0 references
0 references
