
Recent Posts
 Zeros of random polynomials
 Hopf fibration double covers circle bundle of sphere
 Euler’s formula e^ix = cos x + i sin x: a geometric approach
 An inequality for functions on the plane
 Weighted isoperimetric inequalities in warped product manifolds
 FaberKrahn inequality
 Why is a² + b² ≥ 2ab ?
 A remark on the divergence theorem
 The CauchySchwarz inequality and the Lagrange identity
 On the existence of a metric compatible with a given connection
Meta
Recent Comments
tong cheung yu on Toric perspective 1 Miodrag Mateljevic on Principle of subordination Lawrence G Mouille on Exponential maps of Lie g… tong cheung yu on On the existence of a metric c… Marco Barchiesi on Simple curves with a positive… tong cheung yu on Toric perspective 1 lamwk on Why is a² + b² ≥ 2ab ? Maurice OReilly on Spherical cosine law KKK on Sobolev and Isoperimetric… Anonymous on Sobolev and Isoperimetric… Categories
 Algebra
 Algebraic geometry
 Analysis
 Applied mathematics
 Calculus
 Combinatorics
 Complex analysis
 Differential equations
 Differential geometry
 Discrete Mathematics
 Dynamical system
 Fourier analysis
 Functional analysis
 General Relativity
 Geometry
 Group theory
 Inequalities
 Linear Algebra
 Miscellaneous
 Number Theory
 Operator Theory
 Optimization
 Potential theory
 Probability
 Set Theory
 Statistics
 Topology
 Uncategorized
Top Posts
 Complex analysis  Problem solving strategies.
 Martingale Theory II: Conditional expectation
 Martingale Theory III: Optional stopping theorem
 Sobolev and Isoperimetric Inequality
 Taylor expansion of metric
 Lie groups with biinvariant Riemannian metric
 Spherical cosine law
 AMGMHM Inequality: A Statistical Point of View
 Dual norm in R^n
 Sum of angle defects of polyhedrons
Archives
Category Archives: Optimization
Polynomial Optimization 3: Why do we need generalize?
It has been a while since the last post. Let us recall what we have done. We study the unconstrained polynomial optimization problem () where is a real polynomial. This problem is equivalent to () … Continue reading
Posted in Algebra, Applied mathematics, Optimization
Leave a comment
AMGMHM Inequality: A Statistical Point of View
In this post we shall give another proof of the famous AMGMHM inequality: If are positive real numbers, then AM GM HM, precisely .
Posted in Applied mathematics, Calculus, Optimization, Statistics
1 Comment
Polynomial Optimization 2: SOS and SDP
In this article we shall describe something called Grammatrix method which can decompose a polynomial into sum of squares. The notation means is a square symmetric positive semidefinite matrix. Proposition 1. Let , be a polynomial … Continue reading
Posted in Algebra, Applied mathematics, Optimization
Leave a comment
SLemma
This post aims at proving a standard result in quadratic programming called SLemma. The use of this result will be obvious in a future post. We begin with a lemma. Lemma 1. Let be two … Continue reading
Posted in Applied mathematics, Linear Algebra, Optimization
4 Comments
Polynomial Optimization 1: Motivation
(Nov 28, 2013) A (constrained) polynomial minimization problem is in the form () subject to where are polynomials in with real coefficients. If and , then the above problem becomes , an unconstrained polynomial minimization problem. … Continue reading
Posted in Algebra, Applied mathematics, Optimization
Leave a comment
The World of Complexity
(Sept 17, 2013) Our little plan is to write a series of posts discussing a sequence of optimization problems. Before we dive into them, it is cool to learn a rigorous treatment of standard complexity notions P, NP, NPhard and … Continue reading
Posted in Applied mathematics, Optimization
Leave a comment
Notes on Optimization
This is my first time trying to upload my notes here. If the Acrobat Reader does not show all words, please close the file and open the file again. Foundations of Optimization (5 July 2011)