A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization |
scientific article; zbMATH DE number 7036731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization |
scientific article; zbMATH DE number 7036731 |
Statements
A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (English)
0 references
15 March 2019
0 references
inequality constraints
0 references
nonlinear optimization
0 references
strongly sub-feasible method
0 references
quasi interior-point method
0 references
superlinear convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9173182249069214
0 references
0.8453604578971863
0 references
0.8343128561973572
0 references
0.8276644945144653
0 references
