Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming.
Dimitri J. PapageorgiouFrancisco TrespalaciosPublished in: EURO J. Comput. Optim. (2018)
Keyphrases
- shape decomposition
- programming language
- upper bound
- lower bound
- convex optimization
- constrained minimization
- programming environment
- piecewise linear
- globally optimal
- decomposition algorithm
- saddle point
- computer programming
- error bounds
- decomposition method
- convex programming
- significant improvement
- optimal solution