Skip to main content
We are experiencing some difficulties with our submission forms, which we are working to resolve. If you have any issues, please contact us at dspace-lib@mit.edu.
Log in
(current)
MIT Open Scholarship
DSpace@MIT
Search
Home
MIT Open Access Articles
MIT Open Access Articles
Separable Convex Optimization with Nested Lower and Upper Constraints
This is not the latest version of this item. The latest version can be found
here
.
Separable Convex Optimization with Nested Lower and Upper Constraints
Download
Name
1703.01484.pdf
Description
Accepted version
Show more
Size
627.04 KB
Format
Adobe PDF
Checksum
(MD5)
0cc6928dbb1ff3fc0f3ac9e369b01914
Show more
sword-2019-05-31T18:31:32.original.xml (130 B)
Original SWORD entry document
Show more
Author(s)
Vidal, Thibaut
•
Gribel, Daniel
•
Jaillet, Patrick
Date Issued
2019
Journal
INFORMS Journal on Optimization
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Version
Author's final manuscript
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/135113
DOI of Published Version
10.1287/IJOO.2018.0004
