<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.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-22T12:48:34Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/2940" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/2940</identifier><datestamp>2017-03-21T14:58:30Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en" authority="478726b6-9fa2-412d-84f7-125ff3804ce4" confidence="600">Potaptchik, Marina</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-05-08T14:01:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-05-08T14:01:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2006</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2006</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/2940</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We consider a portfolio selection problem in the presence of transaction costs.   Transaction costs on each asset are assumed to be a convex function of the amount sold or bought.   This function can be nondifferentiable in  a finite number of points.   The objective function of this problem is a sum of a convex twice differentiable function and a separable convex nondifferentiable function.   We first consider the problem in the presence of linear constraints and later  generalize the results to the case when the constraints are given by the convex piece-wise linear functions.     &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  Due to the special structure, this problem  can be replaced by an equivalent differentiable problem in a higher dimension.    It&amp;apos;s main drawback is efficiency since the higher dimensional problem is computationally expensive to solve.    &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  We propose  several alternative ways to solve this problem  which do not require introducing new variables or constraints.   We derive the optimality conditions for this problem  using subdifferentials.    First, we generalize an  active set method to this class of problems.    We solve the problem by considering  a sequence of equality constrained subproblems, each subproblem having a twice differentiable objective function.   Information gathered at each step is used to construct the subproblem for the next step.   We also show how the nonsmoothness can be handled efficiently by using spline approximations.    The problem is then solved using a primal-dual interior-point method.     &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  If a higher accuracy is needed, we do   a crossover to an active set method.    Our numerical tests show that we can solve large scale problems efficiently  and accurately.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">849289 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">Copyright: 2006, 
  Potaptchik, Marina. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Convex programming</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">piecewise differentiable functions</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">portfolio optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">transaction costs.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Portfolio Selection Under Nonsmooth Convex Transaction Costs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>