<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T10:13:43Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/114824" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/114824</identifier><datestamp>2026-05-15T19:51:52Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Zhou, Song</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Renegar, James</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Lewis, Adrian</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Davis, Damek</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2024-04-05T18:48:46Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2024-04-05T18:48:46Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2023-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 13923</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 30630914</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/114824</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/w6h4-0r65</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">16219231</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">142 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This work comprises two parts. Part I focuses on the convex feasibility problem (finding or approximating a point in the intersection of finitely many closed convex sets). We avoid the need for orthogonal projections by using radial projections, introduced by Renegar. The main requirement is that an interior point is known in each of the sets considered. By developing Renegar’s theory, we obtain a family of radial projection-based algorithms for the convex feasibility problem which recover the linear convergence rates of orthogonal projection-based methods. Through studying different assumptions on the emptiness of the interior of the intersection set in the convex feasibility problem, we also exhibit how radial projections can be applied to solve constrained optimization problems when certain conditions are met.Part II can be seen as an application of the theory of radial projections developed in Part I. Here, we revisit the notion of maximal-margin classifiers, from around 2000, but now from a general perspective – the intersections of generic closed convex cones, not just half-spaces (i.e., the perceptron). This requires extending concepts and establishing more general theory of the margin function, which is achieved by applying and refining the results in Part I in the conic case. Even more interestingly, we are led to the first Õ(1/ε) first-order method for approximating, within relative error ε, the margin-maximizer of the intersection cone. Previous results, only in the case of the perceptron, were O(1/ε²), making our result a notable improvement even in the most basic of cases.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Convex Feasibility Problem</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">First-Order Method</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Linear Regularity</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Margin Maximization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Perceptron</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Radial Projection</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">RADIAL PROJECTIONS, CONVEX FEASIBILITY PROBLEMS AND MARGIN MAXIMIZATION</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://newcatalog.library.cornell.edu/catalog/16219231</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Operations Research and Information Engineering</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Operations Research and Information Engineering</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810.2</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Zhou, Song</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="8e83c7be-332c-458a-aa0f-c7c2a3c523b3">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en&lt;/Language>
   	&lt;Title>RADIAL PROJECTIONS, CONVEX FEASIBILITY PROBLEMS AND MARGIN MAXIMIZATION&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2023-08&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/w6h4-0r65&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Zhou, Song&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>Convex Feasibility Problem&lt;/Keyword>
    &lt;Keyword>First-Order Method&lt;/Keyword>
    &lt;Keyword>Linear Regularity&lt;/Keyword>
    &lt;Keyword>Margin Maximization&lt;/Keyword>
    &lt;Keyword>Perceptron&lt;/Keyword>
    &lt;Keyword>Radial Projection&lt;/Keyword>
   	&lt;Abstract>This work comprises two parts. Part I focuses on the convex feasibility problem (finding or approximating a point in the intersection of finitely many closed convex sets). We avoid the need for orthogonal projections by using radial projections, introduced by Renegar. The main requirement is that an interior point is known in each of the sets considered. By developing Renegar’s theory, we obtain a family of radial projection-based algorithms for the convex feasibility problem which recover the linear convergence rates of orthogonal projection-based methods. Through studying different assumptions on the emptiness of the interior of the intersection set in the convex feasibility problem, we also exhibit how radial projections can be applied to solve constrained optimization problems when certain conditions are met.Part II can be seen as an application of the theory of radial projections developed in Part I. Here, we revisit the notion of maximal-margin classifiers, from around 2000, but now from a general perspective – the intersections of generic closed convex cones, not just half-spaces (i.e., the perceptron). This requires extending concepts and establishing more general theory of the margin function, which is achieved by applying and refining the results in Part I in the conic case. Even more interestingly, we are led to the first Õ(1/ε) first-order method for approximating, within relative error ε, the margin-maximizer of the intersection cone. Previous results, only in the case of the perceptron, were O(1/ε²), making our result a notable improvement even in the most basic of cases.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>