A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent (Q1810966)
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 simple primal-dual feasible interior-point method for nonlinear programming with monotone descent |
scientific article; zbMATH DE number 1925004
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent |
scientific article; zbMATH DE number 1925004 |
Statements
A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent (English)
0 references
9 June 2003
0 references
constrained optimization
0 references
nonlinear programming
0 references
primal-dual interior-point methods
0 references
feasibility
0 references
monotone descent
0 references