An approximate gradient-type method for nonlinear symmetric equations with convex constraints
From MaRDI portal
Publication:6137785
Recommendations
- Conjugate gradient type methods for semilinear elliptic problems with symmetry
- A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations
- Norm descent conjugate gradient methods for solving symmetric nonlinear equations
- scientific article; zbMATH DE number 440638
- Some conjugate gradient methods for symmetric and nonsymmetric systems
- A new conjugate gradient projection method for convex constrained nonlinear equations
- An inexact semismooth Newton method for variational inequality with symmetric cone constraints
- Efficient hybrid conjugate gradient method for solving symmetric nonlinear equations
- A semismooth Newton method for nonlinear symmetric cone programming
- Derivative-free conjugate gradient type methods for symmetric complementarity problems
Cites work
- scientific article; zbMATH DE number 1306984 (Why is no real title available?)
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- A hybrid projection method for generalized mixed equilibrium problems and fixed point problems in Banach spaces
- A modified Fletcher-Reeves-type derivative-free method for symmetric nonlinear equations
- A new backtracking inexact BFGS method for symmetric nonlinear equations
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations
- An inexact PRP conjugate gradient method for symmetric nonlinear equations
- BFGS trust-region method for symmetric nonlinear equations
- Benchmarking optimization software with performance profiles.
- New three-term conjugate gradient method with guaranteed global convergence
- Norm descent conjugate gradient methods for solving symmetric nonlinear equations
- On variable-step relaxed projection algorithm for variational inequalities
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Some three-term conjugate gradient methods with the inexact line search condition
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
Cited in
(2)
This page was built for publication: An approximate gradient-type method for nonlinear symmetric equations with convex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137785)