Adjoint mode computation of subgradients for McCormick relaxations

DOI10.1007/978-3-642-30023-3_10zbMATH Open1253.65031OpenAlexW2118676429MaRDI QIDQ2913123FDOQ2913123

Authors: M. Beckers, Viktor Mosenkis, Uwe Naumann 

Publication date: 26 September 2012

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30023-3_10

Recommendations

• McCormick-Based Relaxations of Algorithms
• Differentiable McCormick relaxations
• Tighter McCormick relaxations through subgradient propagation
• Multivariate McCormick relaxations
• scientific article; zbMATH DE number 778143

zbMATH Keywords

non-smooth analysisalgorithmic differentiationMcCormick relaxationssubgradientsadjoint mode

Mathematics Subject Classification ID

Numerical differentiation (65D25)

Cited In (10)

• Tighter McCormick relaxations through subgradient propagation
• Whitney differentiability of optimal-value functions for bound-constrained convex programming problems
• amodMC
• Adjoint Code Design Patterns
• General convex relaxations of implicit functions and inverse functions
• The directed and Rubinov subdifferentials of quasidifferentiable functions. II: Calculus
• Manifold sampling for optimizing nonsmooth nonconvex compositions
• Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations
• Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions
• Differentiable McCormick relaxations

Uses Software

• libMC
• modMC

This page was built for publication: Adjoint mode computation of subgradients for McCormick relaxations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913123)