Journal
MATHEMATICAL PROGRAMMING
Volume 87, Issue 2, Pages 215-249Publisher
SPRINGER VERLAG
DOI: 10.1007/s101070050112
Keywords
-
Ask authors/readers for more resources
A new primal-dual algorithm is proposed for the minimization of non-convex objective functions subject to general inequality and linear equality constraints. The method uses a primal-dual trust-region model to ensure descent on a suitable merit function. Convergence is proved to second-order critical points from arbitrary starting points. Numerical results are presented for general quadratic programs.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available