Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems
From MaRDI portal
Publication:884390
DOI10.1016/j.jmaa.2006.11.020zbMath1123.65062OpenAlexW2109797171MaRDI QIDQ884390
Wei-Xin Cheng, Xiao-Yan Ke, Jin-Bao Jian
Publication date: 6 June 2007
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2006.11.020
algorithmglobal convergencenonlinear systemsfinite termination\(\varepsilon\)-generalized projection
Related Items (2)
A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization ⋮ A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization
Cites Work
- An efficient algorithm for solving inequalities
- More test examples for nonlinear programming codes
- Test example for nonlinear programming codes
- Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- A finitely convergent algorithm for convex inequalities
- Methods for finding feasible points in constrained optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems