A logarithmic barrier cutting plane method for convex programming
Year of publication: |
1995
|
---|---|
Authors: | den Hertog, D. ; Kaliski, J. ; Roos, C. ; Terlaky, T. |
Published in: |
Annals of operations research. - New York, NY [u.a.] : Springer Science + Business Media, ISSN 0254-5330, ZDB-ID 2526293. - Vol. 58.1995, p. 69-98
|
Saved in:
Saved in favorites
Similar items by person
-
A scaled Gauss-Newton primal-dual search direction for semidefinite optimization
de Klerk, E., (2001)
-
Initialization in semidefinite programming via a self-dual, skew-symmetric embedding
de Klerk, E., (1997)
-
Long-Step Primal-Dual Target-Following Algorithms for Linear Programming
Jansen, B., (1996)
- More ...