Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints.
Remigijus PaulaviciusJulius ZilinskasPublished in: Optim. Lett. (2016)
Keyphrases
- linear constraints
- optimization problems
- nonlinear programming
- evolutionary algorithm
- constraint databases
- linearly constrained
- cost function
- metaheuristic
- equality constraints
- constraint solver
- objective function
- quadratic program
- convex constraints
- fixed point
- combinatorial optimization
- traveling salesman problem
- constrained optimization problems