On computing the center of a convex quadratically constrained set (Q2276879)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4193460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computing the center of a convex quadratically constrained set |
scientific article; zbMATH DE number 4193460 |
Statements
On computing the center of a convex quadratically constrained set (English)
0 references
1991
0 references
The authors presents an interior point method for finding an analytic center of a convex feasible region whose boundaries are defined by quadratic functions. The algorithm starts from an arbitrary initial point and approaches the desired center by simultaneously reducing infeasibility or slackness of all constraints. A partial Newton step is taken at each iteration.
0 references
convex quadratic programming
0 references
interior point method
0 references
analytic center
0 references
0.8118739128112793
0 references
0.8077691793441772
0 references
0.7953245639801025
0 references
0.7755487561225891
0 references
