Mathematics
Polynomial Optimization
96%
Polynomial
73%
Matrix (Mathematics)
44%
Sum of Squares
40%
Homotopy
38%
Continuation Method
38%
Relaxation Method
27%
Quadratic Programming
27%
Test Problem
24%
Coefficient Matrix
21%
Quasi-Newton Method
19%
Positive Cone
19%
Diagonal
18%
Linear Programming Relaxation
15%
Relative Efficiency
15%
Convex Combination
15%
Numerical Experiment
15%
Regularization
14%
Singular Integral Equation
14%
Deep Neural Network
14%
Lower and upper bounds
14%
Projection Method
14%
Polynomial Equation
13%
Objective Function
13%
Bisection Method
12%
Approximates
11%
Input Data
11%
Square Polynomial
11%
Positive Semidefinite Cone
10%
Positive Semidefinite
10%
Nonlinear Algebraic Equation
9%
Convergence Criterion
9%
Secant Method
9%
Time Discretization
9%
Least Square
9%
Numerical Stability
9%
Parameter Vector
9%
Max-Cut
9%
Quadratic Form
9%
Wide Variety
9%
Convex Function
9%
Alternating Direction Method of Multipliers
9%
Numerical Solution
9%
Hyperplane
9%
Minimization Problem
8%
Stable Set
7%
Gauss-Newton Method
7%
Computational Cost
6%
Integer
6%
Strong Duality
5%
Engineering
Optimisation Problem
73%
Sparsity
67%
Sensor Network
28%
Localization Problem
20%
Reformulation
19%
Coefficient Matrix
15%
Interior Point
11%
Point Method
11%
Quadratically Constrained Quadratic Program
10%
Convex Optimization Problem
9%
Bisection Method
9%
Linear Programming
9%
Discretization
9%
Numerical Solution
9%
Collocation Point
9%
Generalized Inverse
9%
Schur Complement
8%
Computational Efficiency
8%
Optimal Value
7%
Objective Function
5%
Equation System
5%
Computer Science
Semidefinite Programming
100%
Optimization Problem
93%
Sensor Networks
28%
Sparsity
22%
Linear Programming
17%
Localization Problem
16%
Relaxation Method
14%
Least Squares Method
9%
Convex Relaxation
9%
Discretization
9%
Minimization Problem
9%
Objective Function
8%
Computational Cost
6%