A projected gradient trust-region method for solving nonlinear systems with convex constraints
From MaRDI portal
Publication:655752
DOI10.1007/S11766-011-1956-7zbMATH Open1240.90378OpenAlexW1982248317MaRDI QIDQ655752FDOQ655752
Publication date: 27 January 2012
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-011-1956-7
Cites Work
- Title not available (Why is that?)
- Projected gradient methods for linearly constrained problems
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- On the Identification Property of a Projected Gradient Method
- Two-Metric Projection Methods for Constrained Optimization
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Convergence properties of trust region methods for linear and convex constraints
- Affine scaling interior Levenberg-Marquardt method for bound-constrained semismooth equations under local error bound conditions
- Convergence properties of projected gradient methods with nonmonotonic back tracking technique for convex constrained optimization
Cited In (5)
- An efficient conjugate gradient trust-region approach for systems of nonlinear equation
- Convergence of a projected gradient method with trust region for nonlinear constrained optimization†
- Projected quasi-Newton algorithm with trust region for constrained optimization
- A unified derivative-free projection method model for large-scale nonlinear equations with convex constraints
- Supermemory gradient methods for monotone nonlinear equations with convex constraints
This page was built for publication: A projected gradient trust-region method for solving nonlinear systems with convex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655752)
