Polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities

10.1023/A:1008787027641

Saved in:

Bibliographic Details
Main Authors:	Luo, Z.-Q., Sun, J.
Other Authors:	DECISION SCIENCES
Format:	Article
Published:	2013
Online Access:	http://scholarbank.nus.edu.sg/handle/10635/44891
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	National University of Singapore

id	sg-nus-scholar.10635-44891
record_format	dspace
spelling	sg-nus-scholar.10635-448912024-11-09T09:29:51Z Polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities Luo, Z.-Q. Sun, J. DECISION SCIENCES 10.1023/A:1008787027641 Computational Optimization and Applications 15 2 167-191 CPPPE 2013-10-10T04:36:58Z 2013-10-10T04:36:58Z 2000 Article Luo, Z.-Q., Sun, J. (2000). Polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities. Computational Optimization and Applications 15 (2) : 167-191. ScholarBank@NUS Repository. https://doi.org/10.1023/A:1008787027641 09266003 http://scholarbank.nus.edu.sg/handle/10635/44891 000085085600004 Scopus
institution	National University of Singapore
building	NUS Library
continent	Asia
country	Singapore Singapore
content_provider	NUS Library
collection	ScholarBank@NUS
description	10.1023/A:1008787027641
author2	DECISION SCIENCES
author_facet	DECISION SCIENCES Luo, Z.-Q. Sun, J.
format	Article
author	Luo, Z.-Q. Sun, J.
spellingShingle	Luo, Z.-Q. Sun, J. Polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
author_sort	Luo, Z.-Q.
title	Polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
title_short	Polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
title_full	Polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
title_fullStr	Polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
title_full_unstemmed	Polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
title_sort	polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
publishDate	2013
url	http://scholarbank.nus.edu.sg/handle/10635/44891
_version_	1821183371821187072

Polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities

Similar Items