An Almost Feasible Sequential Linear Programming Algorithm.
David KiesslingCharlie VanaretAlejandro AstudilloWilm DecréJan SweversPublished in: ECC (2024)
Keyphrases
- linear programming
- dynamic programming
- np hard
- learning algorithm
- recognition algorithm
- objective function
- optimal solution
- preprocessing
- cost function
- high accuracy
- computational cost
- theoretical analysis
- worst case
- path planning
- optimization algorithm
- times faster
- segmentation algorithm
- computationally efficient
- convergence rate
- k means
- data sets
- memory requirements
- benchmark problems
- convex hull
- integer programming
- classification algorithm
- simulated annealing
- probabilistic model
- experimental evaluation
- computational complexity
- neural network