Login / Signup
A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints.
Le Hong Trang
Attila Kozma
Thanh An Phan
Moritz Diehl
Published in:
Optim. Methods Softw. (2016)
Keyphrases
</>
convex constraints
convex programming
objective function
convex optimization
learning algorithm
computational complexity
np hard
linear programming
max flow
worst case
convergence rate
global consistency
optimal solution
high dimensional
semidefinite programming