Global convergence of a filter-trust-region algorithm for solving nonsmooth equations
From MaRDI portal
Publication:3568420
DOI10.1080/00207160802195993zbMath1232.65094MaRDI QIDQ3568420
Liqun Qi, Zhenghao Yang, Wen-Yu Sun
Publication date: 11 June 2010
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160802195993
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints, A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations, Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration
Cites Work
- On filter-successive linearization methods for nonlinear semidefinite programming
- On the convergence of some quasi-Newton methods for nonlinear equations with nondifferentiable operators
- Local convergence of quasi-Newton methods for B-differentiable equations
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- A nonsmooth version of Newton's method
- Nonsmooth Equations: Motivation and Algorithms
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- The restricted generalized inverses corresponding to constrained quadratic system∗
- A Globally Convergent Filter Method for Nonlinear Programming
- A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
- A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
- Trust Region Algorithms for Solving Nonsmooth Equations
- A Filter-Trust-Region Method for Unconstrained Optimization
- Nonlinear programming without a penalty function.