A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP

Pacific Journal of Optimization

Saved in:

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

id	sg-nus-scholar.10635-102728
record_format	dspace
spelling	sg-nus-scholar.10635-1027282024-11-08T17:52:15Z A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP Li, L. Toh, K.-C. MATHEMATICS Inexact search direction Infeasible interior point method Polynomial complexity Semidefinite least squares Semidefinite programming Pacific Journal of Optimization 7 1 43-61 2014-10-28T02:29:02Z 2014-10-28T02:29:02Z 2011-01 Article Li, L.,Toh, K.-C. (2011-01). A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP. Pacific Journal of Optimization 7 (1) : 43-61. ScholarBank@NUS Repository. 13489151 http://scholarbank.nus.edu.sg/handle/10635/102728 NOT_IN_WOS 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 Semidefinite least squares Semidefinite programming
spellingShingle	Inexact search direction Infeasible interior point method Polynomial complexity Semidefinite least squares Semidefinite programming Li, L. Toh, K.-C. A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
description	Pacific Journal of Optimization
author2	MATHEMATICS
author_facet	MATHEMATICS Li, L. Toh, K.-C.
format	Article
author	Li, L. Toh, K.-C.
author_sort	Li, L.
title	A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
title_short	A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
title_full	A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
title_fullStr	A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
title_full_unstemmed	A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
title_sort	polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic sdp
publishDate	2014
url	http://scholarbank.nus.edu.sg/handle/10635/102728
_version_	1821183320923308032

A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP

Similar Items