A polynomial-time algorithm for linear optimization based on a new simple kernel function (Q4650623): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users 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.1080/10556780310001639735 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011694001 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Self-regular functions and new search directions for linear and semidefinite optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4791754 / rank | |||
Normal rank | |||
Latest revision as of 18:14, 7 June 2024
scientific article; zbMATH DE number 2134954
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for linear optimization based on a new simple kernel function |
scientific article; zbMATH DE number 2134954 |
Statements
A polynomial-time algorithm for linear optimization based on a new simple kernel function (English)
0 references
18 February 2005
0 references
linear optimization
0 references
interior-point method
0 references
primal-dual method
0 references
large- and small-update method
0 references
polynomial complexity
0 references
0 references
