A primal-dual trust-region algorithm for non-convex nonlinear programming
- 264 Downloads
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.
KeywordsObjective Function Linear Equality Equality Constraint Nonlinear Programming Quadratic Program
Unable to display preview. Download preview PDF.