Analysis of Optimization Algorithms via Integral Quadratic Constraints: Nonstrongly Convex Problems.
Mahyar FazlyabAlejandro RibeiroManfred MorariVictor M. PreciadoPublished in: SIAM J. Optim. (2018)
Keyphrases
- optimization problems
- convex optimization problems
- quadratic program
- penalty functions
- convex optimization
- linear constraints
- combinatorial optimization
- discrete optimization
- semidefinite
- constrained minimization
- benchmark problems
- np hard optimization problems
- quadratic optimization problems
- optimization criteria
- convex functions
- learning algorithm
- objective function
- convex relaxation
- computational complexity
- evolutionary algorithm
- constrained problems
- mixed integer
- constraint programming
- quasiconvex
- convex constraints
- semi definite programming
- efficient optimization
- optimization approaches
- optimization methods
- constrained optimization
- convex programming
- mathematical programming
- decision variables
- penalty function
- dual variables
- partial solutions
- stationary points
- global optimality
- knapsack problem
- linear programming problems
- constraint satisfaction
- nonlinear programming
- globally convergent