Abstract
We study an infeasible primal-dual interior-point trust-region method for constrained minimization. This method uses a log-barrier function for the slack variables and updates the slack variables using second-order correction. We show that if a certain set containing the initial iterate is bounded and the origin is not in the convex hull of the nearly active constraint gradients everywhere on this set, then the iterates remain in this set, and any cluster point of the iterates is a first-order stationary point. Moreover, any subsequence of iterates converging to the cluster point has an asymptotic second-order stationarity property, which, when the constraint functions are affine or when the active constraint gradients are linearly independent, implies that the cluster point is a second-order stationary point. Preliminary numerical experience with the method is reported. A primal method and its extension to semidefinite nonlinear programming is also discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
