Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization
DOI10.1016/S0377-0427(02)00870-1zbMath1028.65065OpenAlexW2001239641MaRDI QIDQ1811590
Publication date: 17 June 2003
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(02)00870-1
global convergencenumerical experimentsNonmonotonic techniquelinear constrained optimizationTrust region methodsInterior point algorithmBack trackingline-search techniques
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items (10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More test examples for nonlinear programming codes
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Test examples for nonlinear programming codes
- Nonmonotonic trust region algorithm
- Computing a Trust Region Step
- Newton’s Method with a Model Trust Region Modification
- A Trust Region Interior Point Algorithm for Linearly Constrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
This page was built for publication: Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization