<mets:mets OBJID="eprint_4105" LABEL="Eprints Item" xsi:schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mets="http://www.loc.gov/METS/" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mets:metsHdr CREATEDATE="2024-01-01T23:20:32Z"><mets:agent ROLE="CUSTODIAN" TYPE="ORGANIZATION"><mets:name>IIASA Repository</mets:name></mets:agent></mets:metsHdr><mets:dmdSec ID="DMD_eprint_4105_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:titleInfo><mods:title>Large-Scale Convex Optimization via Saddle Point Computation</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">M.J.</mods:namePart><mods:namePart type="family">Kallio</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">C.H.</mods:namePart><mods:namePart type="family">Rosa</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>This article proposes large-scale convex optimization problems to be solved via saddle points of the standard Lagrangian. A recent approach for saddle point computation is specialized, by way of a specific perturbation technique and unique scaling method, to convex optimization problems with differentiable objective and constraint functions. In each iteration the update directions for primal and dual variables are determined by gradients of the Lagrangian. These gradients are evaluated at perturbed points which are generated from current points via auxiliary mappings. The resulting algorithm suits massively parallel computing. Sparsity can be exploited efficiently. Employing simulation of parallel computations, an experimental code embedded into GAMS is tested on two sets of nonlinear problems. The first set arises from multi-stage stochastic optimization of the US energy economy. The second set consists of multi-currency bond portfolio problems. In such stochastic optimization problems the serial time appears approximatively proportional to the number of scenarios, while the parallel time seems independent of the number of scenarios. Thus, we observe that the serial time of our approach in comparison with Minos increases slower with the problem size. Consequently, for large problems with reasonable precision requirements, our method appears faster than Minos even in a serial computer.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1994-10</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>WP-94-107</mods:publisher></mods:originInfo><mods:genre>Monograph</mods:genre></mets:xmlData></mets:mdWrap></mets:dmdSec><mets:amdSec ID="TMD_eprint_4105"><mets:rightsMD ID="rights_eprint_4105_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:useAndReproduction>
<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by its own author:</strong>
In self-archiving this collection of files and associated bibliographic
metadata, I grant IIASA Repository the right to store
them and to make them permanently available publicly for free on-line.
I declare that this material is my own intellectual property and I
understand that IIASA Repository does not assume any
responsibility if there is any breach of copyright in distributing these
files or metadata. (All authors are urged to prominently assert their
copyright on the title page of their work.)</p>

<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by someone other than its
author:</strong> I hereby declare that the collection of files and
associated bibliographic metadata that I am archiving at
IIASA Repository) is in the public domain. If this is
not the case, I accept full responsibility for any breach of copyright
that distributing these files or metadata may entail.</p>

<p xmlns="http://www.w3.org/1999/xhtml">Clicking on the deposit button indicates your agreement to these
terms.</p>
    </mods:useAndReproduction></mets:xmlData></mets:mdWrap></mets:rightsMD></mets:amdSec><mets:fileSec><mets:fileGrp USE="reference"><mets:file ID="eprint_4105_3874_1" SIZE="531376" OWNERID="https://pure.iiasa.ac.at/id/eprint/4105/1/WP-94-107.pdf" MIMETYPE="application/pdf"><mets:FLocat LOCTYPE="URL" xlink:type="simple" xlink:href="https://pure.iiasa.ac.at/id/eprint/4105/1/WP-94-107.pdf"></mets:FLocat></mets:file></mets:fileGrp></mets:fileSec><mets:structMap><mets:div DMDID="DMD_eprint_4105_mods" ADMID="TMD_eprint_4105"><mets:fptr FILEID="eprint_4105_document_3874_1"></mets:fptr></mets:div></mets:structMap></mets:mets>