Secant algorithms with nonmonotone trust region that employs fletcher penalty function for constrained optimization

DOI10.1080/02331930108844556zbMATH Open1049.90093OpenAlexW2004641621MaRDI QIDQ2767580FDOQ2767580

Authors: Detong Zhu 

Publication date: 2001

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930108844556

Recommendations

• A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization
• A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization
• A trust region algorithm for equality constrained optimization
• A nonmonotone trust region algorithm for equality constrained optimization
• scientific article; zbMATH DE number 740463

zbMATH Keywords

constrained optimizationtrust regionsecant methodsnonmonotonic techniqueFletcher's penalty function

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30)

Cites Work

• A Nonmonotone Line Search Technique for Newton’s Method
• A trust region algorithm for equality constrained optimization
• Nonmonotonic trust region algorithm
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Projected quasi-Newton algorithm with trust region for constrained optimization
• Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
• Newton’s Method with a Model Trust Region Modification
• Approximate solution of the trust region problem by minimization over two-dimensional subspaces
• Continuity of the null space basis and constrained optimization
• A Convergence Theory for a Class of Quasi-Newton Methods for Constrained Optimization
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation
• Local Convergence of Secant Methods for Nonlinear Constrained Optimization
• On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem

Cited In (2)

• A convergent secant method for constrained optimization
• A family of improved secant methods via nonmonotone curvilinear paths technique for equality constrained optimization

This page was built for publication: Secant algorithms with nonmonotone trust region that employs fletcher penalty function for constrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2767580)