Solving semidefinite quadratic problems within nonsmooth optimization algorithms.
Antonio FrangioniPublished in: Comput. Oper. Res. (1996)
Keyphrases
- semidefinite
- interior point
- optimization problems
- quadratic program
- semidefinite programming
- convex relaxation
- interior point methods
- bilevel programming
- higher dimensional
- solving problems
- globally convergent
- quadratic programming
- learning algorithm
- convex optimization
- sufficient conditions
- computational complexity
- finite dimensional
- linear programming
- evolutionary algorithm
- globally optimal
- computationally intensive
- convex sets
- maximum margin
- convergence rate
- linear program
- simulated annealing
- objective function