<?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-22T08:32:23Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/70089" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/70089</identifier><datestamp>2026-05-15T19:50:55Z</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">Wylie, Calvin</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Lewis, Adrian S.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Davis, Damek Shea</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Bindel, David S.</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2020-06-23T18:02:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2020-06-23T18:02:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2019-12</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 11824</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 27664608</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/70089</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/c7gg-3e23</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">13119697</dim:field>
   <dim:field mdschema="dc" element="description">126 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Optimization and variational problems typically involve a highly structured blend of smooth and nonsmooth geometry. In nonlinear programming, such structure underlies the design of active-set algorithms, in which a globally convergent process first simplifies the problem by identifying active constraints at the solution; a second phase then employs a rapidly-convergent Newton-type method, with linear models of the simplified problem playing a central role. The theory of partial smoothness formalizes and highlights the fundamental geometry driving ``identification.'' This dissertation concentrates on the second phase, and understanding accelerated local convergence in partly smooth settings. A key contribution is a simple algorithm for ``black-box'' nonsmooth optimization, that incorporates second-order information with the usual linear approximation oracle. Motivated by active sets and sequential quadratic programming, a model-based approach is used to prove local quadratic convergence for a broad class of objectives. Promising numerical results on more general functions, as well as simple first-order analogues, are discussed. Beyond optimization, an intuitive linearization scheme for generalized equations is formalized, with simple techniques based on classical differential geometry: manifolds, normal and tangent spaces, and constant rank maps. The approach illuminates fundamental geometric ideas behind active-set acceleration techniques for variational inequalities, as well as second-order theory and algorithms for structured nonsmooth optimization.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="rights">Attribution 4.0 International</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">https://creativecommons.org/licenses/by/4.0/</dim:field>
   <dim:field mdschema="dc" element="title">Partly Smooth Models and Algorithms</dim:field>
   <dim:field mdschema="dc" element="type">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://newcatalog.library.cornell.edu/catalog/13119697</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="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</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">Wylie, Calvin</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="9c10c38c-2a97-4e95-98df-d09fe5e766e8">
	&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>Partly Smooth Models and Algorithms&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2019-12&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/c7gg-3e23&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Wylie, Calvin&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/4.0/&lt;/License>
   	&lt;Abstract>Optimization and variational problems typically involve a highly structured blend of smooth and nonsmooth geometry. In nonlinear programming, such structure underlies the design of active-set algorithms, in which a globally convergent process first simplifies the problem by identifying active constraints at the solution; a second phase then employs a rapidly-convergent Newton-type method, with linear models of the simplified problem playing a central role. The theory of partial smoothness formalizes and highlights the fundamental geometry driving ``identification.&amp;apos;&amp;apos; This dissertation concentrates on the second phase, and understanding accelerated local convergence in partly smooth settings. A key contribution is a simple algorithm for ``black-box&amp;apos;&amp;apos; nonsmooth optimization, that incorporates second-order information with the usual linear approximation oracle. Motivated by active sets and sequential quadratic programming, a model-based approach is used to prove local quadratic convergence for a broad class of objectives. Promising numerical results on more general functions, as well as simple first-order analogues, are discussed. Beyond optimization, an intuitive linearization scheme for generalized equations is formalized, with simple techniques based on classical differential geometry: manifolds, normal and tangent spaces, and constant rank maps. The approach illuminates fundamental geometric ideas behind active-set acceleration techniques for variational inequalities, as well as second-order theory and algorithms for structured nonsmooth optimization.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>