A path following algorithm for a class of convex programming problems

Authors: Jishan Zhu

Source: ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research. 36:359-377

Subject Terms: Convex programming, scaled Lipschitz condition, entropy optimization, primal-dual path following interior algorithm, Computational methods for problems pertaining to operations research and mathematical programming, linearly constrained convex programming problems, 0211 other engineering and technologies, 02 engineering and technology, 0101 mathematics, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/89435
https://doi.org/10.1007/bf01416235
https://dblp.uni-trier.de/db/journals/mmor/mmor36.html#Zhu92
https://link.springer.com/article/10.1007/BF01416235