Все публикации

Non-convex Optimization via Convex Optimization Algorithms

Cauchy-Schwarz Inequality

Notation

Linear Programming

Addition and Elimination of Variables

Change of Variables

Least Squares Problem

Zeroth Order Condition for Convexity

Singular Value Decomposition

Motivation for Convex Optimization

General Norms

PSD Cone

LP in Communications Systems

First and Second Order Conditions for Convexity

Robust Optimization

Transformations that preserve Convexity

Relating Convex Sets and Functions

Examples of Convex Sets

Composition Rules for Convex Functions

Positive Definite Matrices

Convex Problems

Example: Verifying Convexity

L1 and L-Infinity Norm Minimization (Approximation Problems)

Supporting and Separating Hyperplanes

welcome to shbcf.ru