Abstract
ABSTRACTWe propose a derivative-free algorithm for solving linear equality constrained non-linear optimization problems, named LECOA. In each iteration of the algorithm, the objective function is approximated by a quadratic model constructed from interpolation points. The choice of the points leaves some degree of freedom in the model taken up by minimizing the Frobenius norm of the change to the Hessian matrix of the model. The new iterate is generally generated by minimizing the model in a trust-region using a null space truncated conjugate gradient method. Numerical results are presented which show that the proposed algorithm competes against some algorithms in the literature. Experiments show that starting with the point that minimizes the infinity norm subject to the linear equality constraints gives excellent results. A limit-type global convergence of the proposed algorithm is proved under some reasonable assumptions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.