Let $A$ be a symmetric matrix which is positive-definite. Let $\langle d_1,d_2 \rangle = d_1^TAd_2$ and $||d|| = \sqrt{\langle d, d \rangle}$. How can I determine the normalized direction of the steepest descent of a function $f$? In case of the euclidean Norm the solution is $d=-\frac{\nabla f(x)}{||\nabla f(x) ||}$, but I'm stuck finding out a solution for the given norm.
2026-04-02 13:58:53.1775138333
Steepest descent with other norm
508 Views Asked by user724291 https://math.techqa.club/user/user724291/detail At
1
There are 1 best solutions below
Related Questions in ANALYSIS
- Analytical solution of a nonlinear ordinary differential equation
- Finding radius of convergence $\sum _{n=0}^{}(2+(-1)^n)^nz^n$
- Show that $d:\mathbb{C}\times\mathbb{C}\rightarrow[0,\infty[$ is a metric on $\mathbb{C}$.
- conformal mapping and rational function
- What are the functions satisfying $f\left(2\sum_{i=0}^{\infty}\frac{a_i}{3^i}\right)=\sum_{i=0}^{\infty}\frac{a_i}{2^i}$
- Proving whether function-series $f_n(x) = \frac{(-1)^nx}n$
- Elementary question on continuity and locally square integrability of a function
- Proving smoothness for a sequence of functions.
- How to prove that $E_P(\frac{dQ}{dP}|\mathcal{G})$ is not equal to $0$
- Integral of ratio of polynomial
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 NONLINEAR-OPTIMIZATION
- Prove that Newton's Method is invariant under invertible linear transformations
- set points in 2D interval with optimality condition
- Finding a mixture of 1st and 0'th order Markov models that is closest to an empirical distribution
- Sufficient condition for strict minimality in infinite-dimensional spaces
- Weak convergence under linear operators
- Solving special (simple?) system of polynomial equations (only up to second degree)
- Smallest distance to point where objective function value meets a given threshold
- KKT Condition and Global Optimal
- What is the purpose of an oracle in optimization?
- Prove that any Nonlinear program can be written in the form...
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?
The direction of steepest descent is the unit vector that minimizes the directional derivative, i.e. $d$ should minimize $\langle\nabla f, d\rangle = \nabla f^T A d$. This direction is when $Ad = -\nabla f$. As $A$ is positive definite we can solve this system to get $d = -A^{-1}\nabla f$. As said before $d$ is only a direction, so we should normalize it to be unit length.
$||d|| = \sqrt{\langle -A^{-1}\nabla f, -A^{-1}\nabla f \rangle} = \sqrt{\nabla f^TA^{-1}A A^{-1}\nabla f} = \sqrt{\nabla f^TA^{-1}\nabla f}$.
Then the direction of steepest descent is $\frac{d}{||d||}$.