A conjugate gradient projection method for solving equations with convex constraints (Q2309250): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 22:46, 17 December 2024

scientific article

Language	Label	Description	Also known as
English	A conjugate gradient projection method for solving equations with convex constraints	scientific article

Statements

scholarly article

0 references

A conjugate gradient projection method for solving equations with convex constraints (English)

0 references

0 references

0 references

0 references

Journal of Computational and Applied Mathematics

0 references

publication date

30 March 2020

0 references

zbMATH Keywords

nonlinear equations

0 references

derivative-free method

0 references

conjugate gradient method

0 references

global convergence

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cam.2020.112781

0 references

A new inexact alternating directions method for monotone variational inequalities

0 references

An extragradient algorithm for monotone variational inequalities

0 references

Conservation laws, binary Darboux transformations and solitons for a higher-order nonlinear Schrödinger system

0 references

Quintic time-dependent-coefficient derivative nonlinear Schrödinger equation in hydrodynamics or fiber optics: bilinear forms and dark/anti-dark/gray solitons

0 references

Gramian solutions and soliton interactions for a generalized (3 + 1)-dimensional variable-coefficient Kadomtsev–Petviashvili equation in a plasma or fluid

0 references

Mathematical view with observational/experimental consideration on certain \((2+1)\)-dimensional waves in the cosmic/laboratory dusty plasmas

0 references

Solitons, Bäcklund transformation and Lax pair for a (2+1)-dimensional Davey-Stewartson system on surface waves of finite depth

0 references

Solitons for the (2+1)-dimensional Konopelchenko-Dubrovsky equations

0 references

Superlinear convergence of a Newton-type algorithm for monotone equations

0 references

A globally convergent BFGS method for nonlinear monotone equations without any merit functions

0 references

A class of derivative-free methods for large-scale nonlinear monotone equations

0 references

A three-term derivative-free projection method for nonlinear monotone system of equations

0 references

Spectral DY-Type Projection Method for Nonlinear Monotone Systems of Equations

0 references

Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems

0 references

Spectral residual method without gradient information for solving large-scale nonlinear systems of equations

0 references

0 references

On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

0 references

An Interior-Point Method for Semidefinite Programming

0 references

The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints

0 references

0 references

Spectral gradient projection method for monotone nonlinear equations with convex constraints

0 references

A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing

0 references

A projection method for convex constrained monotone nonlinear equations with applications

0 references

A derivative-free iterative method for nonlinear monotone equations with convex constraints

0 references

An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints

0 references

0 references

A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence

0 references

Some descent three-term conjugate gradient methods and their global convergence

0 references

A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization

0 references

A projection method for a system of nonlinear monotone equations with convex constraints

0 references

An Efficient Implementation of Merrill’s Method for Sparse or Partially Separable Systems of Nonlinear Equations

0 references

Benchmarking optimization software with performance profiles.

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.CAM.2020.112781

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2309250

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2309250&oldid=39001726"