Stable Bounds on the Duality Gap of Separable Nonconvex Optimization Problems.
Thomas KerdreuxIgor ColinAlexandre d'AspremontPublished in: Math. Oper. Res. (2023)
Keyphrases
- duality gap
- optimization problems
- nonlinear programming
- inequality constraints
- optimality conditions
- augmented lagrangian
- constrained optimization problems
- evolutionary algorithm
- primal dual
- objective function
- convex optimization
- metaheuristic
- convex programming
- set covering problem
- cost function
- optimization methods
- traveling salesman problem
- optimal solution
- knapsack problem
- linear programming
- linear programming problems
- constrained optimization
- interior point methods
- combinatorial optimization
- lagrangian dual
- nsga ii
- ant colony optimization
- particle swarm optimization
- simulated annealing
- dynamic programming
- constrained problems
- multi objective
- dual formulation
- search algorithm