Numerical experience with a polyhedral-norm CDT trust-region algorithm

DOI10.1007/BF02193057zbMath0831.90103OpenAlexW1993176194MaRDI QIDQ1896572

Richard A. Tapia, Mahmoud M. El-Alem

Publication date: 18 February 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02193057

zbMATH Keywords

constrained optimizationCelis-Dennis-Tapia trust-region subproblem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (2)

Numerical experience with a polyhedral-norm CDT trust-region algorithm ⋮ Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization

Uses Software

• NPSOL
• NLPQL
• QPSOL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a subproblem of trust region algorithms for constrained optimization
• Test examples for nonlinear programming codes
• A trust region algorithm for equality constrained optimization
• Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization
• Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
• Numerical experience with a polyhedral-norm CDT trust-region algorithm
• A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization

This page was built for publication: Numerical experience with a polyhedral-norm CDT trust-region algorithm