Mathematics of Operations Research, Vol. 41, No. 2 (May 2016), pp. 442-465 (24 pages) In view of solving nonsmooth and nonconvex problems involving complex constraints (like standard NLP problems), we ...

An interior trust-region-based algorithm for linearly constrained minimization problems is proposed and analyzed. This algorithm is similar to trust region algorithms for unconstrained minimization: a ...