A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints

作者: Andrew R. Conn , Nicholas I. M. Gould , Philippe L. Toint

DOI: 10.1007/978-1-4757-3226-9_2

关键词:

摘要: A new primal-dual algorithm is proposed for the minimization of non-convex objective functions subject to simple bounds and linear equality constraints. The method alternates between a classical step Newton-like modified barrier in order ensure descent on suitable merit function. Convergence well-defined subsequence iterates proved from arbitrary starting points. Preliminary numerical results are presented.

参考文章(33)
Philip E Gill, Michael A Saunders, Margaret H Wright, Walter Murray, A Schur-complement method for sparse quadratic programming Oxford University Press. pp. 113- 138 ,(1987)
Dulce B. Ponceleon, Barrier methods for large-scale quadratic programming Stanford University. ,(1991) , 10.21236/ADA238554
J. Gondzio, C. Meszaros, E.D. Andersen, X. Xu, Implementation of Interior Point Methods for Large Scale Linear Programming Research Papers in Economics. ,(1996)
I. Bongartz, A. R. Conn, Nick Gould, Ph. L. Toint, CUTE: constrained and unconstrained testing environment ACM Transactions on Mathematical Software. ,vol. 21, pp. 123- 160 ,(1995) , 10.1145/200979.201043
Anders Forsgren, Philip E. Gill, Primal-Dual Interior Methods for Nonconvex Nonlinear Programming Siam Journal on Optimization. ,vol. 8, pp. 1132- 1152 ,(1998) , 10.1137/S1052623496305560
Stephen M. Robinson, A quadratically-convergent algorithm for general nonlinear programming problems Mathematical Programming. ,vol. 3-3, pp. 145- 156 ,(1972) , 10.1007/BF01584986
J. H. Wilkinson, The algebraic eigenvalue problem ,(1965)
Anders Forsgren, Philip E. Gill, Joseph R. Shinnerl, Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization SIAM Journal on Matrix Analysis and Applications. ,vol. 17, pp. 187- 211 ,(1996) , 10.1137/S0895479894270658