A sufficient condition for self-concordance, with application to some classes of structured convex programming problems (Q1922691): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0025-5610(94)00065-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4239974430 / rank | |||
Normal rank | |||
Latest revision as of 20:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for self-concordance, with application to some classes of structured convex programming problems |
scientific article |
Statements
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems (English)
0 references
18 September 1996
0 references
dual geometric programming
0 references
Lipschitz condition
0 references
self-concordance
0 references
low-complexity interior-point methods
0 references
logarithmic barrier function
0 references
