On the classical logarithmic barrier method for a class of smooth convex programming problems

D. den Hertog, C. Roos, T. Terlaky

Research output: Contribution to journalArticleScientificpeer-review

17 Downloads (Pure)
Original languageEnglish
Pages (from-to)1-25
Number of pages25
JournalJournal of Optimization Theory and Applications
Volume73
Issue number1
Publication statusPublished - 1992
Externally publishedYes

Cite this

@article{377676e90ed448cdb150576cd02f96d6,
title = "On the classical logarithmic barrier method for a class of smooth convex programming problems",
author = "{den Hertog}, D. and C. Roos and T. Terlaky",
note = "Pagination: 25",
year = "1992",
language = "English",
volume = "73",
pages = "1--25",
journal = "Journal of Optimization Theory and Applications",
issn = "0022-3239",
publisher = "SPRINGER/PLENUM PUBLISHERS",
number = "1",

}

On the classical logarithmic barrier method for a class of smooth convex programming problems. / den Hertog, D.; Roos, C.; Terlaky, T.

In: Journal of Optimization Theory and Applications, Vol. 73, No. 1, 1992, p. 1-25.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - On the classical logarithmic barrier method for a class of smooth convex programming problems

AU - den Hertog, D.

AU - Roos, C.

AU - Terlaky, T.

N1 - Pagination: 25

PY - 1992

Y1 - 1992

M3 - Article

VL - 73

SP - 1

EP - 25

JO - Journal of Optimization Theory and Applications

JF - Journal of Optimization Theory and Applications

SN - 0022-3239

IS - 1

ER -