Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Generalized derivatives of optimal-value functions with parameterized convex programs embedded

Generalized derivatives of optimal-value functions with parameterized convex programs embedded

Thumbnail Image
Download
Name

10898_2023_Article_1359.pdf

Size

523.53 KB

Format

Adobe PDF

Checksum (MD5)

766299dfb67da4569aa1704cfaf6a335

Download all files submitted through automated deposit
art_5304113160459371547.zip (274.11 KB)
Author(s)
Song, Yingkai
•
Barton, Paul I.
Date Issued
January 25, 2024
Publisher
Springer US
Citation
Song, Y., Barton, P.I. Generalized derivatives of optimal-value functions with parameterized convex programs embedded. J Glob Optim (2024).
Version
Final published version
Abstract
This article proposes new practical methods for furnishing generalized derivative information of optimal-value functions with embedded parameterized convex programs, with potential applications in nonsmooth equation-solving and optimization. We consider three cases of parameterized convex programs: (1) partial convexity—functions in the convex programs are convex with respect to decision variables for fixed values of parameters, (2) joint convexity—the functions are convex with respect to both decision variables and parameters, and (3) linear programs where the parameters appear in the objective function. These new methods calculate an LD-derivative, which is a recently established useful generalized derivative concept, by constructing and solving a sequence of auxiliary linear programs. In the general partial convexity case, our new method requires that the strong Slater conditions are satisfied for the embedded convex program’s decision space, and requires that the convex program has a unique optimal solution. It is shown that these conditions are essentially less stringent than the regularity conditions required by certain established methods, and our new method is at the same time computationally preferable over these methods. In the joint convexity case, the uniqueness requirement of an optimal solution is further relaxed, and to our knowledge, there is no established method for computing generalized derivatives prior to this work. In the linear program case, both the Slater conditions and the uniqueness of an optimal solution are not required by our new method.
MIT Department
Massachusetts Institute of Technology. Department of Chemical Engineering
Massachusetts Institute of Technology. Process Systems Engineering Laboratory
Terms of Use
Creative Commons Attribution
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/153419
DOI of Published Version
https://doi.org/10.1007/s10898-023-01359-9
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.