Pose Graph Optimization in the Complex Domain: Lagrangian Duality, Conditions For Zero Duality Gap, and Optimal Solutions.
Giuseppe Carlo CalafioreLuca CarloneFrank DellaertPublished in: CoRR (2015)
Keyphrases
- duality gap
- complex domains
- optimal solution
- convex programming
- augmented lagrangian
- primal dual
- constrained optimization
- inequality constraints
- optimality conditions
- set covering problem
- global optimality
- nonlinear programming
- linear programming
- lagrangian dual
- global optimization
- optimization algorithm
- dual formulation
- optimization problems
- np hard
- feature selection
- objective function
- lagrange multipliers
- convex optimization
- branch and bound algorithm
- saddle point
- metaheuristic
- learning algorithm
- reinforcement learning
- linear programming problems
- genetic algorithm
- machine learning
- bayesian networks
- set covering
- lower bound
- cost function
- interior point methods
- domain theory
- branch and bound