Whitney differentiability of optimal-value functions for bound-constrained convex programming problems

DOI10.1080/02331934.2018.1534108zbMath1462.90135OpenAlexW2896884742WikidataQ129084108 ScholiaQ129084108MaRDI QIDQ4634171

Kamil A. Khan

Publication date: 7 May 2019

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2018.1534108

zbMATH Keywords

parametric optimizationconvex underestimatorssmoothing methods

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Continuity and differentiation questions (26B05)

Uses Software

• BARON
• amodMC
• libMC
• dcc
• ANTIGONE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved relaxations for the parametric solutions of ODEs using differential inequalities
• Differentiable McCormick relaxations
• Convergence analysis of multivariate McCormick relaxations
• Convergence rate of McCormick relaxations
• The cluster problem revisited
• Introduction to sensitivity and stability analysis in nonlinear programming
• Derived eigenvalues of symmetric matrices, with applications to distance geometry
• Practical bilevel optimization. Algorithms and applications
• The cluster problem in multivariate global optimization
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• BARON: A general purpose global optimization software package
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Multivariate McCormick relaxations
• Adjoint Mode Computation of Subgradients for McCormick Relaxations
• Convex and concave relaxations of implicit functions
• The Art of Differentiating Computer Programs
• Evaluating Derivatives
• McCormick-Based Relaxations of Algorithms
• Differential properties of the marginal function in mathematical programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Optimization Problems with Perturbations: A Guided Tour
• Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
• Adjoint Sensitivity Analysis for Differential-Algebraic Equations: The Adjoint DAE System and Its Numerical Solution
• Whitney extension theorems for convex functions of the classes C1 and C1,ω
• The Theory of Max-Min, with Applications
• Convex Analysis