Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming

10.1007/s10107-003-0431-5

Saved in:

Bibliographic Details
Main Authors:	Zhou, G., Toh, K.-C.
Other Authors:	MATHEMATICS
Format:	Article
Published:	2014
Subjects:	Inexact search direction Infeasible interior point method Polynomial complexity Primal-dual Semidefinite programming
Online Access:	http://scholarbank.nus.edu.sg/handle/10635/103947
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	National University of Singapore

id	sg-nus-scholar.10635-103947
record_format	dspace
spelling	sg-nus-scholar.10635-1039472023-10-26T09:33:21Z Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming Zhou, G. Toh, K.-C. MATHEMATICS Inexact search direction Infeasible interior point method Polynomial complexity Primal-dual Semidefinite programming 10.1007/s10107-003-0431-5 Mathematical Programming 99 2 261-282 2014-10-28T02:43:26Z 2014-10-28T02:43:26Z 2004-03 Article Zhou, G., Toh, K.-C. (2004-03). Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming. Mathematical Programming 99 (2) : 261-282. ScholarBank@NUS Repository. https://doi.org/10.1007/s10107-003-0431-5 00255610 http://scholarbank.nus.edu.sg/handle/10635/103947 000220377800004 Scopus
institution	National University of Singapore
building	NUS Library
continent	Asia
country	Singapore Singapore
content_provider	NUS Library
collection	ScholarBank@NUS
topic	Inexact search direction Infeasible interior point method Polynomial complexity Primal-dual Semidefinite programming
spellingShingle	Inexact search direction Infeasible interior point method Polynomial complexity Primal-dual Semidefinite programming Zhou, G. Toh, K.-C. Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
description	10.1007/s10107-003-0431-5
author2	MATHEMATICS
author_facet	MATHEMATICS Zhou, G. Toh, K.-C.
format	Article
author	Zhou, G. Toh, K.-C.
author_sort	Zhou, G.
title	Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
title_short	Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
title_full	Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
title_fullStr	Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
title_full_unstemmed	Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
title_sort	polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
publishDate	2014
url	http://scholarbank.nus.edu.sg/handle/10635/103947
_version_	1781787799794483200

Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming

Similar Items