A three-term subspace projection method for solving systems of nonlinear monotone equations
From MaRDI portal
Cites work
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- A derivative-free iterative method for nonlinear monotone equations with convex constraints
- A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
- A New Projection Method for Variational Inequality Problems
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A PRP type method for systems of monotone equations
- A self-adaptive projection method for nonlinear monotone equations with convex constraints
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- An adaptive family of projection methods for constrained monotone nonlinear equations with applications
- An efficient projection-based algorithm without Lipschitz continuity for large-scale nonlinear pseudo-monotone equations
- An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints
- An efficient three-term conjugate gradient-based algorithm involving spectral quotient for solving convex constrained monotone nonlinear equations with applications
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Approximation algorithms for the capacitated correlation clustering problem with penalties
- Benchmarking optimization software with performance profiles.
- Chemical equilibrium systems as numerical test problems
- Fast algorithms for finding the solution of CUPL-Toeplitz linear system from Markov chain
- Galerkin spectral approximations for optimal control problems governed by the fourth order equation with an integral constraint on state
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications
- scientific article; zbMATH DE number 1306984 (Why is no real title available?)
- Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming
- Modified matrix-free methods for solving system of nonlinear equations
- Monotonicity of fixed point and normal mappings associated with variational inequality and its application
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- Newton-type Methods with Generalized Distances For Constrained Optimization
- Non-smooth equations based method for _1-norm problems with applications to compressed sensing
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- Superlinear convergence of a Newton-type algorithm for monotone equations
- The conjugate gradient method in extremal problems
- Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit
Cited in
(1)
This page was built for publication: A three-term subspace projection method for solving systems of nonlinear monotone equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857057)
