Is there a theory of constrained optimization with complex variables, do you know any textbook on that topic? The typical textbooks on constrained optimization deal with real variables. I actually found some references which loosely explain the procedure of derivating w.r.t. the complex conjugate to obtain optimality conditions but could not find a rigorous mathematical justification. In particular I am interested in using a Lagrangian, and couldn't find any reference on that. Thanks.
2026-03-27 17:58:43.1774634323
Constrained optimization with complex variables
4.3k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in REFERENCE-REQUEST
- Best book to study Lie group theory
- Alternative definition for characteristic foliation of a surface
- Transition from theory of PDEs to applied analysis and industrial problems and models with PDEs
- Random variables in integrals, how to analyze?
- Abstract Algebra Preparation
- Definition of matrix valued smooth function
- CLT for Martingales
- Almost locality of cubic spline interpolation
- Identify sequences from OEIS or the literature, or find examples of odd integers $n\geq 1$ satisfying these equations related to odd perfect numbers
- property of Lebesgue measure involving small intervals
Related Questions in OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- optimization with strict inequality of variables
- Gradient of Cost Function To Find Matrix Factorization
- Calculation of distance of a point from a curve
- Find all local maxima and minima of $x^2+y^2$ subject to the constraint $x^2+2y=6$. Does $x^2+y^2$ have a global max/min on the same constraint?
- What does it mean to dualize a constraint in the context of Lagrangian relaxation?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Building the model for a Linear Programming Problem
- Maximize the function
- Transform LMI problem into different SDP form
Related Questions in CONVEX-OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- Least Absolute Deviation (LAD) Line Fitting / Regression
- Check if $\phi$ is convex
- Transform LMI problem into different SDP form
- Can a linear matrix inequality constraint transform to second-order cone constraint(s)?
- Optimality conditions - necessary vs sufficient
- Minimization of a convex quadratic form
- Prove that the objective function of K-means is non convex
- How to solve a linear program without any given data?
- Distance between a point $x \in \mathbb R^2$ and $x_1^2+x_2^2 \le 4$
Related Questions in SEVERAL-COMPLEX-VARIABLES
- Let $h(z) = g(f(z))$. If $f$ and $h$ are non-constant holomorphic function on domains in $\mathbb C^n$, then is $g$ holomorphic?
- If power series in two variables and logarithmically convex Reinhardt domains
- Product of holomorphically convex spaces is again holomorphically convex
- Differential Geometry tools in Several Complex Variables
- Is the complement of a complex affine algebraic set in an irreducible complex affine algebraic set (path) connected in the euclidean topology?
- Any entire holomorphic function that is bounded on countably infinite number of complex-lines must be constant.
- Do there exist infinitely many complex lines through the origin?
- Can a pure codimension d analytic subset be defined by a d-tuple of holomorphic functions?
- How to show $\int_{0}^{\infty} \frac{dx}{x^3+1} = \frac{2\pi}{3\sqrt{3}}$
- Build a Blaschke product such as $B^*(1)=\lim_{r\to 1}B(r)=0$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
I realize this is an old question, but there are several good references on this subject. While the objective function must map to the real line, its argument is free to be complex, which means that its gradient and Hessian can be complex (Hermitian instead of symmetric), however, it is important to recognize that you are not just optimizing $f(z)$ where $f:\mathbb{C}^n\rightarrow\mathbb{R}$ over $z$, but also its complex conjugate $\bar z$, since $f$ cannot be holomorphic and be real-valued.
Constraints are free to be complex $c:\mathbb{C}^n\rightarrow \mathbb{C}^m$, however, the Lagrangian must be real-valued. This approach will lead to exactly the same results as using $z=x+iy$ above.
Optimization over complex variables invokes what is typically called the Wirtinger Calculus (mostly in German references and $\mathbb{CR}$-calculus in in English ones.) A nice clear pedagogical introduction to complex differentiation in with emphasis on optimization can be found here.