BMR and BWR: Two simple metaphor-free optimization algorithms for solving real-life non-convex constrained and unconstrained problems.
Ravipudi Venkata RaoRavikumar shahPublished in: CoRR (2024)
Keyphrases
- convex optimization problems
- optimization problems
- convex optimization
- real life
- constrained problems
- combinatorial optimization
- quadratic optimization problems
- quadratic program
- discrete optimization
- alternating direction method of multipliers
- convex programming
- interior point methods
- optimization approaches
- optimization methods
- solving problems
- problems in artificial intelligence
- linearly constrained
- efficient optimization
- global optimization problems
- partial solutions
- saddle point
- efficient algorithms for solving
- evolutionary algorithm
- lagrange multipliers
- quadratic programming
- primal dual
- synthetic datasets
- benchmark problems
- linear program
- np complete problems
- semi definite programming
- minimization problems
- interior point
- learning algorithm
- search heuristics
- optimization algorithm
- metaheuristic
- genetic algorithm
- stochastic shortest path
- search algorithm
- computational complexity
- simulated annealing
- linear programming
- np complete
- bilevel programming
- convergence rate
- constrained optimization
- combinatorial problems
- semidefinite programming
- convex functions
- exact algorithms
- optimization criteria
- resource constrained project scheduling problem