Local Convergence of Secant Methods for Nonlinear Constrained Optimization

From MaRDI portal
Publication:3476213

DOI10.1137/0725042zbMath0698.65042OpenAlexW2089677701MaRDI QIDQ3476213

R. Fontecilla

Publication date: 1988

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0725042




Related Items (17)

A convergent secant method for constrained optimizationA projective quasi-Newton method for nonlinear optimizationA heuristic algorithm for nonlinear programmingAn analysis of reduced Hessian methods for constrained optimizationLine search filter inexact secant methods for nonlinear equality constrained optimizationA line search filter secant method for nonlinear equality constrained optimizationA secant algorithm with line search filter method for nonlinear optimizationA filter secant method with nonmonotone line search for equality constrained optimizationA dwindling filter line search algorithm for nonlinear equality constrained optimizationA family of the local convergence of the improved secant methods for nonlinear equality constrained optimization subject to bounds on variablesPartitioned quasi-Newton methods for nonlinear equality constrained optimizationSecant algorithms with nonmonotone trust region that employs fletcher penalty function for constrained optimizationA family of improved secant methods via nonmonotone curvilinear paths technique for equality constrained optimizationNonmonotonic projected algorithm with both trust region and line search for constrained optimizationConvergence properties of improved secant methods with region multiplierLocal convergence analysis for the REQP algorithm using conjugate basis matricesA class of improved affine-scaling interior-point secant filter methods for minimization with equality and box constraints


Uses Software






This page was built for publication: Local Convergence of Secant Methods for Nonlinear Constrained Optimization