A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques

DOI10.1137/S1064827595284403zbMath0912.90262MaRDI QIDQ4210415

Todd Plantenga

Publication date: 21 September 1998

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

interior-point algorithmsconstrained optimizationlarge-scale optimizationnonlinear optimizationtrust region methodsbarrier methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items (4)

A three-dimension null-space approach for mathematical programs with equilibrium constraints. ⋮ Penalty-free method for nonsmooth constrained optimization via radial basis functions ⋮ A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization ⋮ An infeasible interior-point arc-search algorithm for nonlinear constrained optimization

Uses Software

• LANCELOT
• SNOPT
• TRICE
• NPSOL

This page was built for publication: A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques