Login / Signup
A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach.
Paul Armand
Jean Charles Gilbert
Sophie Jan-Jégou
Published in:
Math. Program. (2002)
Keyphrases
</>
convergence rate
np hard
cost function
dc programming
objective function
optimal solution
computational complexity
evolutionary algorithm
combinatorial optimization
quadratic programming
learning algorithm
special case
dynamic programming
worst case
knapsack problem
convex optimization problems