A Trust Region Interior Point Algorithm for Linearly Constrained Optimization

Authors:
J. Frédéric Bonnans;Cecilia Pola
Affiliations:
-;-
Venue:
SIAM Journal on Optimization
Year:
1997

Citing 0
Cited 5

A Shifted-Barrier Primal-Dual Algorithm Model for Linearly ConstrainedOptimization Problems

Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part I
Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization

Journal of Computational and Applied Mathematics
An interior affine scaling projective algorithm for nonlinear equality and linear inequality constrained optimization

Journal of Computational and Applied Mathematics
Convergence Properties of Dikin"s Affine Scaling Algorithm for Nonconvex Quadratic Minimization

Journal of Global Optimization
Newton-KKT interior-point methods for indefinite quadratic programming

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 prove that, under suitable hypotheses, the algorithm converges to a point satisfying the first-order optimality system, and we analyze under which conditions the unit stepsize will be asymptotically accepted.