Interior-Point Algorithms for a Class of Convex Optimization Problems
Goran Lešaja; Verlynda N. Slaughter
The Yugoslav Journal of Operations Research (2009)
- Volume: 19, Issue: 38, page 239-248
- ISSN: 0354-0243
Access Full Article
top
How to cite
topGoran Lešaja, and Verlynda N. Slaughter. "Interior-Point Algorithms for a Class of Convex Optimization Problems." The Yugoslav Journal of Operations Research 19.38 (2009): 239-248. <http://eudml.org/doc/261479>.
@article{GoranLešaja2009,
author = {Goran Lešaja, Verlynda N. Slaughter},
journal = {The Yugoslav Journal of Operations Research},
language = {eng},
number = {38},
pages = {239-248},
publisher = {Faculty of Organizational Sciences},
title = {Interior-Point Algorithms for a Class of Convex Optimization Problems},
url = {http://eudml.org/doc/261479},
volume = {19},
year = {2009},
}
TY - JOUR
AU - Goran Lešaja
AU - Verlynda N. Slaughter
TI - Interior-Point Algorithms for a Class of Convex Optimization Problems
JO - The Yugoslav Journal of Operations Research
PY - 2009
PB - Faculty of Organizational Sciences
VL - 19
IS - 38
SP - 239
EP - 248
LA - eng
UR - http://eudml.org/doc/261479
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.