Andrew R. Conn, Paula K. Coulman, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Paper
A primal-dual trust-region algorithm for non-convex nonlinear programming
Abstract
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.
Related
Andrew R. Conn, Katya Scheinberg, et al.
SIAM Journal on Optimization
Caio Merlini Giuliani, Eduardo Camponogara, et al.
Computational and Applied Mathematics
Benjamin Reiser, Betty J. Flehinger, et al.
IEEE Transactions on Reliability