Generalized Adjoint Method

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Zheng, Andrew, Stinchcombe, Adam R.
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909995395710976
author Zheng, Andrew
Stinchcombe, Adam R.
author_facet Zheng, Andrew
Stinchcombe, Adam R.
contents The adjoint method is an efficient way to numerically compute gradients in optimization problems with constraints, but is only formulated to differentiable cost and constraint functions on real variables. With the introduction of complex variables, which occur often in many inverse problems in electromagnetism and signal processing problems, both the cost and constraint can become non-holomorphic and hence non-differentiable in the standard definitions. Using the notion of CR-calculus, a generalized adjoint method is introduced that can compute the direction of steepest ascent for the cost function while enforcing the constraint even if both are non-holomorphic.
format Preprint
id arxiv_https___arxiv_org_abs_2601_13395
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Generalized Adjoint Method
Zheng, Andrew
Stinchcombe, Adam R.
Optimization and Control
The adjoint method is an efficient way to numerically compute gradients in optimization problems with constraints, but is only formulated to differentiable cost and constraint functions on real variables. With the introduction of complex variables, which occur often in many inverse problems in electromagnetism and signal processing problems, both the cost and constraint can become non-holomorphic and hence non-differentiable in the standard definitions. Using the notion of CR-calculus, a generalized adjoint method is introduced that can compute the direction of steepest ascent for the cost function while enforcing the constraint even if both are non-holomorphic.
title Generalized Adjoint Method
topic Optimization and Control
url https://arxiv.org/abs/2601.13395