Andrew R. Conn, Luís N. Vicente, et al.
SIAM Journal on Optimization
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.
Andrew R. Conn, Luís N. Vicente, et al.
SIAM Journal on Optimization
Sonia Cafieri, Andrew R. Conn, et al.
EJOR
Caio Merlini Giuliani, Eduardo Camponogara, et al.
Computational and Applied Mathematics
Andreas Wächter, Chandu Visweswariah, et al.
Future Generation Computer Systems