An interior-point penalty active-set trust-region algorithm
نویسندگان
چکیده
منابع مشابه
A Trust Region Interior Point Algorithm for Linearly Constrained Optimization
We present an extension, for nonlinear optimization under linear constraints, of an algorithm for quadratic programming using a trust region idea introduced by Ye and Tse [Math. Programming, 44 (1989), pp. 157–179] and extended by Bonnans and Bouhtou [RAIRO Rech. Opér., 29 (1995), pp. 195–217]. Due to the nonlinearity of the cost, we use a linesearch in order to reduce the step if necessary. We...
متن کاملAn interior-point trust-funnel algorithm for nonlinear optimization
We present an interior-point trust-funnel algorithm for solving large-scale nonlinear optimization problems. The method is based on an approach proposed by Gould and Toint (Math. Prog., 122(1):155196, 2010) that focused on solving equality constrained problems. Our method is similar in that it achieves global convergence guarantees by combining a trust-region methodology with a funnel mechanism...
متن کاملAn Interior-Point Trust-Region Algorithm for General Symmetric Cone Programming
An interior-point trust-region algorithm is proposed for minimization of general (perhaps, non-convex) quadratic objective function over the domain obtained as the intersection of a symmetric cone with an affine subspace. The algorithm uses a trust-region model to ensure descent on a suitable merit function. Convergence to first-order and second-order optimality conditions is proved. Numerical ...
متن کاملA penalty-interior-point algorithm for nonlinear constrained optimization
Penalty and interior-point methods for nonlinear optimization problems have enjoyed great successes for decades. Penalty methods have proved to be effective for a variety of problem classes due to their regularization effects on the constraints. They have also been shown to allow for rapid infeasibility detection. Interior-point methods have become the workhorse in large-scale optimization due ...
متن کاملAnalysis of Inexact Trust-Region Interior-Point SQP Algorithms
In this paper we analyze inexact trust–region interior–point (TRIP) sequential quadra– tic programming (SQP) algorithms for the solution of optimization problems with nonlinear equality constraints and simple bound constraints on some of the variables. Such problems arise in many engineering applications, in particular in optimal control problems with bounds on the control. The nonlinear constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Egyptian Mathematical Society
سال: 2016
ISSN: 1110-256X
DOI: 10.1016/j.joems.2016.04.003