I am studying this set of notes. In 1.2 they proof the creation of a ball with the optimal solution (x*) inside. I am having difficulties to undertsand how the betha-strong convexity of f implies the first ball and how the alpha-smoothness implies te second one.
2026-02-23 14:09:40.1771855780
Proof of bound an optimal solution of minimum problem with strong convexity and smoothness
37 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
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 GRADIENT-DESCENT
- Gradient of Cost Function To Find Matrix Factorization
- Can someone explain the calculus within this gradient descent function?
- Established results on the convergence rate of iterates for Accelerated Gradient Descent?
- Sensitivity (gradient) of function solved using RK4
- Concerning the sequence of gradients in Nesterov's Accelerated Descent
- Gradient descent proof: justify $\left(\dfrac{\kappa - 1}{\kappa + 1}\right)^2 \leq \exp(-\dfrac{4t}{\kappa+1})$
- If the gradient of the logistic loss is never zero, does that mean the minimum can never be achieved?
- How does one show that the likelihood solution for logistic regression has a magnitude of infinity for separable data (Bishop exercise 4.14)?
- How to determinate that a constrained inequality system is not empty?
- How to show that the gradient descent for unconstrained optimization can be represented as the argmin of a quadratic?
Related Questions in SMOOTH-FUNCTIONS
- Connecting smooth functions in a smooth way
- Is the restriction (to lower dimensions) of a smooth function still smooth?
- Understanding the proof of the Concentration-Compactness principle
- Does an integral inequality imply a pointwise inequality?
- A weird definition of regular function
- Are charts for smooth manifolds homeomorphisms or diffeomorphisms?
- Find a sequence $(\phi_n)_n \subset C^{\infty}_c(\mathbb{R}^N)$ which converges in both $L^p(\nu)$ and $L^q(\mu)$ to $1_E$
- Straight Lines are Strict Minimizers of Arclength in Euclidean Space
- Several Questions on Smooth Urysohn's Lemma
- For what functions is $\lim_{n\to \infty}|f^{(n)}(x)|=0$? (Where $f^{(n)}(x)$ is the $n$th derivative of $f$)
Related Questions in STRONG-CONVERGENCE
- Understanding a problem and the construction of a proof
- Prove strong convergence in Hilbert space
- Divergence free property preserved under weak convergence in $L^2$
- Mazur Lemma for sequence of Lipschitz functions
- Exercise on Sobolev Spaces and strong/weak convergence
- Book of Functional analysis
- Convergence in trace-class norm
- Example Not convergent uniformly
- Double Limit of operators converges weakly, does single limit converge?
- Strongly convergence and Uniformly convergence in Banach space
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 first result is obtained by completing the square technique. Consider the definition of strong convexity: $$f(y)\geq f(x) + \nabla f(x)^T(y - x) + \frac{\alpha}{2}\|y-x\|^2, \qquad \forall x,y.$$ If you move the inner product inside the norm, you get $$f(y)\geq f(x) + \frac{\alpha}{2}\|y-x + \frac{1}{\alpha}\nabla f(x)\|^2 - \frac{\|\nabla f(x)\|^2}{2\alpha}, \qquad \forall x,y.$$ Rearrangement of terms yields $$\frac{\|\nabla f(x)\|^2}{\alpha^2} -\frac{2}{\alpha}(f(x) - f(y))\geq \|y-x + \frac{1}{\alpha}\nabla f(x)\|^2, \qquad \forall x,y.$$ Now substitution of $y = x^\star$ and $x^{++} = x - \frac{1}{\alpha}\nabla f(x)$ gives $$\frac{\|\nabla f(x)\|^2}{\alpha^2} -\frac{2}{\alpha}(f(x) - f(x^\star))\geq \|x^\star-x^{++}\|^2, \qquad \forall x$$ which implies $$x^\star \in \mathbb{B}\left(x^{++}, \frac{\|\nabla f(x)\|^2}{\alpha^2} -\frac{2}{\alpha}(f(x) - f(x^\star))\right).$$ To obtain the second identity, you need to replace $f(x)$ with its lower bound given in the note.