Publication:

An algorithm for computing solutions of variational problems with global convexity constraints

Date

Date

Date
2010
Journal Article
Published version
cris.lastimport.scopus2025-06-05T03:42:11Z
cris.lastimport.wos2025-07-23T01:31:08Z
dc.contributor.institutionUniversity of Zurich
dc.date.accessioned2020-11-24T14:50:03Z
dc.date.available2020-11-24T14:50:03Z
dc.date.issued2010
dc.description.abstract

We present an algorithm to approximate the solutions to variational problems where set of admissible functions consists of convex functions. The main motivation behind the numerical method is to compute solutions to Adverse Selection problems within a Principal-Agent framework. Problems such as product lines design, optimal taxation, structured derivatives design, etc. can be studied through the scope of these models. We develop a method to estimate their optimal pricing schedules.

dc.identifier.doi10.1007/s00211-009-0270-2
dc.identifier.issn0029-599X
dc.identifier.othermerlin-id:7968
dc.identifier.scopus2-s2.0-76849087816
dc.identifier.urihttps://www.zora.uzh.ch/handle/20.500.14742/174329
dc.identifier.wos000274549100002
dc.language.isoeng
dc.subject.ddc330 Economics
dc.title

An algorithm for computing solutions of variational problems with global convexity constraints

dc.typearticle
dcterms.accessRightsinfo:eu-repo/semantics/closedAccess
dcterms.bibliographicCitation.journaltitleNumerische Mathematik
dcterms.bibliographicCitation.number1
dcterms.bibliographicCitation.originalpublishernameSpringer
dcterms.bibliographicCitation.pageend69
dcterms.bibliographicCitation.pagestart45
dcterms.bibliographicCitation.volume115
dspace.entity.typePublicationen
uzh.contributor.affiliationThe University of British Columbia
uzh.contributor.affiliationHumboldt-Universität zu Berlin
uzh.contributor.authorEkeland, Ivar
uzh.contributor.authorMoreno-Bromberg, Santiago
uzh.contributor.correspondenceNo
uzh.contributor.correspondenceYes
uzh.document.availabilityno_document
uzh.eprint.datestamp2020-11-24 14:50:03
uzh.eprint.lastmod2025-07-23 02:07:16
uzh.eprint.statusChange2020-11-24 14:50:03
uzh.harvester.ethNo
uzh.harvester.nbNo
uzh.jdb.eprintsId24045
uzh.oastatus.unpaywallclosed
uzh.oastatus.zoraClosed
uzh.publication.citationEkeland, Ivar; Moreno-Bromberg, Santiago (2010). An algorithm for computing solutions of variational problems with global convexity constraints. Numerische Mathematik, 115(1):45-69.
uzh.publication.originalworkoriginal
uzh.publication.publishedStatusfinal
uzh.publication.scopedisciplinebased
uzh.relatedUrl.typepub
uzh.relatedUrl.urlhttps://link.springer.com/content/pdf/10.1007/s00211-009-0270-2.pdf
uzh.scopus.impact18
uzh.scopus.subjectsComputational Mathematics
uzh.scopus.subjectsApplied Mathematics
uzh.workflow.chairSubjectBanking
uzh.workflow.chairSubjectProfJeanCharlesRochet1
uzh.workflow.doajuzh.workflow.doaj.false
uzh.workflow.eprintid192342
uzh.workflow.fulltextStatusnone
uzh.workflow.revisions43
uzh.workflow.rightsCheckkeininfo
uzh.workflow.statusarchive
uzh.wos.impact17
Publication available in collections: