Adjoint Mode Computation of Subgradients for McCormick Relaxations-Reference-Cited by-同舟云学术

Adjoint Mode Computation of Subgradients for McCormick Relaxations

Published:2012 Issue: Volume: Page:103-113
ISSN:1439-7358
Container-title:Lecture Notes in Computational Science and Engineering
language:
Short-container-title:

Author:

Beckers Markus,Mosenkis Viktor,Naumann Uwe

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-30023-3_10

Reference10 articles.

1. Bauer, F.: Computational graphs and rounding error. SIAM Journal on Numerical Analysis 11(1), 87–96 (1974). DOI 10.1137/0711010

2. Corbett, C., Naumann, U.: Demonstration of a branch-and-bound algorithm for global optimization using McCormick relaxations. Tech. Rep. AIB-2011-24, RWTH Aachen (2011). URL http://aib.informatik.rwth-aachen.de/2011/2011-24.pdf

3. Griewank, A.: Piecewise linearization via Algorithmic Differentiation. Twelfth Euro AD Workshop, Berlin (2011)

4. Griewank, A., Walther, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, 2nd edn. No. 105 in Other Titles in Applied Mathematics. SIAM, Philadelphia, PA (2008). URL http://www.ec-securehost.com/SIAM/OT105.html

5. Hiriart-Urruty, J., Lemaréchal, C.: Fundamentals of Convex Analysis. Springer-Verlag (2001)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations;Optimization Methods and Software;2024-05-21

2. General convex relaxations of implicit functions and inverse functions;Journal of Global Optimization;2023-04-10

3. Toward Global Search for Local Optima;Operations Research Proceedings;2020

4. An introduction to algorithmic differentiation;WIREs Data Mining and Knowledge Discovery;2019-10-24

5. Adjoint Code Design Patterns;ACM Transactions on Mathematical Software;2019-08-12