Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems (Q1572675): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPHA / rank | |||
Normal rank | |||
Revision as of 08:04, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems |
scientific article |
Statements
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems (English)
0 references
21 July 2000
0 references
convex programming
0 references
infeasibility detection
0 references
homogeneous self-dual model
0 references
primal-dual interior-point algorithms
0 references
infeasible-start methods
0 references
