<?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:08:21Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/114645" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/114645</identifier><datestamp>2026-05-15T19:44:56Z</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">Han, X.Y.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Lewis, Adrian</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Renegar, James</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Chen, Yudong</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2024-04-05T18:46:44Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2024-04-05T18:46:44Z</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: 13814</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 30572965</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/114645</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/4rrv-8h61</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">16219241</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">126 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">First-order, blackbox optimization methods aim to minimize objective functions using only function and gradient evaluations. On smooth, strongly-convex objectives; classical results ensure the linear convergence of these methods relative to the number of function and gradient evaluations. An analogous nonsmooth theory is challenging due to a lack of reliable, local models. As a consequence, convergence guarantees for nonsmooth optimization procedures have generally remained sublinear. In this dissertation, I propose a "survey descent" method - inspired by a new max-of-smooth model - where an iteratively-updated "survey" of points move closer-and-closer to the objective minimizer while guided by (but never touching) an "active manifold" that lies at the boundary of different smooth subdomains of the nonsmooth objective. I prove that, when the nonsmooth objective possesses a "finite-max" structure, survey descent exhibits local linear convergence; and I demonstrate empirically that survey descent holds promise even beyond the finite-max case. I also propose a blackbox initialization procedure for survey descent that finds an initial survey containing exactly one point from each smooth subdomain of a finite-max objective. Of separate interest, I show how the minimization of the numerical radii of square matrices frequently generates solutions that land on the aforementioned active manifold - an interesting example for an "identification" property of proximal operators, a common subroutine used within nonsmooth optimization methods.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="rights" lang="*">Attribution-NonCommercial-ShareAlike 4.0 International</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="*">https://creativecommons.org/licenses/by-nc-sa/4.0/</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Blackbox optimization, Nonsmooth Structure, and Survey Descent</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/16219241</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">Han, X.Y.</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="89d5205a-d40a-41d5-85e6-0ff934e6f951">
	&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>Blackbox optimization, Nonsmooth Structure, and Survey Descent&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2023-08&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/4rrv-8h61&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Han, X.Y.&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;License>https://creativecommons.org/licenses/by-nc-sa/4.0/&lt;/License>
   	&lt;Abstract>First-order, blackbox optimization methods aim to minimize objective functions using only function and gradient evaluations. On smooth, strongly-convex objectives; classical results ensure the linear convergence of these methods relative to the number of function and gradient evaluations. An analogous nonsmooth theory is challenging due to a lack of reliable, local models. As a consequence, convergence guarantees for nonsmooth optimization procedures have generally remained sublinear. In this dissertation, I propose a &amp;quot;survey descent&amp;quot; method - inspired by a new max-of-smooth model - where an iteratively-updated &amp;quot;survey&amp;quot; of points move closer-and-closer to the objective minimizer while guided by (but never touching) an &amp;quot;active manifold&amp;quot; that lies at the boundary of different smooth subdomains of the nonsmooth objective. I prove that, when the nonsmooth objective possesses a &amp;quot;finite-max&amp;quot; structure, survey descent exhibits local linear convergence; and I demonstrate empirically that survey descent holds promise even beyond the finite-max case. I also propose a blackbox initialization procedure for survey descent that finds an initial survey containing exactly one point from each smooth subdomain of a finite-max objective. Of separate interest, I show how the minimization of the numerical radii of square matrices frequently generates solutions that land on the aforementioned active manifold - an interesting example for an &amp;quot;identification&amp;quot; property of proximal operators, a common subroutine used within nonsmooth optimization methods.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>