The Conjugate Residual Method for Constrained Minimization Problems
From MaRDI portal
Cited in
(21)- Planar quasi-Newton algorithms for unconstrained saddlepoint problems
- Computational methods of linear algebra
- Conjugate gradient-type algorithms for a finite-element discretization of the Stokes equations
- Minimization methods with constraints
- Subspace selection algorithms to be used with the nonlinear projection methods in solving systems of nonlinear equations
- Method of optimum control
- Conjugate gradient and minimal residual method for solving symmetric indefinite systems
- An approach to nonlinear programming
- Stochastic optimization problems with nondifferentiable cost functionals
- Pipelined, flexible Krylov subspace methods
- Branch Cuts of Stokes Wave on Deep Water. Part I: Numerical Solution and Padé Approximation
- A first order, exact penalty function algorithm for equality constrained optimization problems
- An Optimal Preconditioner for a Class of Saddle Point Problems with a Penalty Term
- On the boundary integral equation treatment of exterior acoustic problems
- The Conjugate Residual Method in Linesearch and Trust-Region Methods
- Numerically stable fluid-structure interactions between compressible flow and solid structures
- \textsc{MinAres}: an iterative solver for symmetric linear systems
- Discretize first, filter next: learning divergence-consistent closure models for large-eddy simulation
- Heavy Ball GMRESR method for Nonsymmetric Linear Systems
- Optimal filter design subject to output sidelobe constraints: Computational algorithm and numerical results
- On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
This page was built for publication: The Conjugate Residual Method for Constrained Minimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5609709)
