Notice

This is not the latest version of this item. The latest version can be found at:https://dspace.mit.edu/handle/1721.1/135113.2

Show simple item record

dc.contributor.authorVidal, Thibaut
dc.contributor.authorGribel, Daniel
dc.contributor.authorJaillet, Patrick
dc.date.accessioned2021-10-27T20:10:48Z
dc.date.available2021-10-27T20:10:48Z
dc.date.issued2019
dc.identifier.urihttps://hdl.handle.net/1721.1/135113
dc.language.isoen
dc.publisherInstitute for Operations Research and the Management Sciences (INFORMS)
dc.relation.isversionof10.1287/IJOO.2018.0004
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.sourceMIT web domain
dc.titleSeparable Convex Optimization with Nested Lower and Upper Constraints
dc.typeArticle
dc.relation.journalINFORMS Journal on Optimization
dc.eprint.versionAuthor's final manuscript
dc.type.urihttp://purl.org/eprint/type/JournalArticle
eprint.statushttp://purl.org/eprint/status/PeerReviewed
dc.date.updated2019-05-31T18:31:32Z
dspace.orderedauthorsVidal, T; Gribel, D; Jaillet, P
dspace.date.submission2019-05-31T18:31:33Z
mit.journal.volume1
mit.journal.issue1
mit.metadata.statusAuthority Work and Publication Information Needed


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

VersionItemDateSummary

*Selected version