The following pages link to Algorithm 851 (Q3549169):
Displaying 49 items.
- Computing equilibrium measures with power law kernels (Q5097375) (← links)
- (Q5123967) (← links)
- Modeling and control through leadership of a refined flocking system (Q5176157) (← links)
- An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization (Q5200551) (← links)
- Second-order adjoints for solving PDE-constrained optimization problems (Q5200554) (← links)
- An adaptive nonmonotone trust region method based on a modified scalar approximation of the Hessian in the successive quadratic subproblems (Q5242267) (← links)
- Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization (Q5268936) (← links)
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q5436920) (← links)
- A Two-Term PRP-Based Descent Method (Q5438278) (← links)
- Two hybrid nonlinear conjugate gradient methods based on a modified secant equation (Q5495572) (← links)
- A descent family of Dai–Liao conjugate gradient methods (Q5746716) (← links)
- A new nonmonotone line search technique for unconstrained optimization (Q5919724) (← links)
- An efficient adaptive scaling parameter for the spectral conjugate gradient method (Q5963695) (← links)
- SOBMOR: Structured Optimization-Based Model Order Reduction (Q6039262) (← links)
- An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method (Q6053540) (← links)
- A structured Fletcher-Revees spectral conjugate gradient method for unconstrained optimization with application in robotic model (Q6063796) (← links)
- Bayesian calibration for large‐scale fluid structure interaction problems under embedded/immersed boundary framework (Q6092206) (← links)
- A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications (Q6093343) (← links)
- Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing (Q6109887) (← links)
- A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression (Q6114952) (← links)
- Alternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applications (Q6126026) (← links)
- A family of the modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent and conjugacy conditions (Q6138348) (← links)
- A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization (Q6141538) (← links)
- A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM (Q6142230) (← links)
- A new subspace minimization conjugate gradient method for unconstrained minimization (Q6150649) (← links)
- Adaptive multigrid strategy for geometry optimization of large-scale three dimensional molecular mechanics (Q6158095) (← links)
- Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization (Q6161550) (← links)
- A restart scheme for the memoryless BFGS method (Q6169212) (← links)
- Globally convergent conjugate gradient algorithms without the Lipschitz condition for nonconvex optimization (Q6175333) (← links)
- A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method (Q6175562) (← links)
- Necessary and sufficient conditions for near‐optimal controls of a stochastic West Nile virus system with spatial diffusion (Q6180765) (← links)
- An overview of nonlinear optimization (Q6200213) (← links)
- A class of CG algorithms overcoming jamming of the iterative solving process and its application in image restoration (Q6489243) (← links)
- Convergence analysis of block majorize-minimize subspace approach (Q6542454) (← links)
- An accelerated conjugate gradient method with adaptive two-parameter with applications in image restoration (Q6543751) (← links)
- Sparse signal reconstruction via Hager–Zhang-type schemes for constrained system of nonlinear equations (Q6548327) (← links)
- A scalar Hessian estimation with a sparse nonmonotone line search technique for the sparse recovery problem (Q6574066) (← links)
- A nonmonotone adaptive trust region technique with a forgetting factor (Q6581413) (← links)
- Another Hager-Zhang-type method via singular-value study for constrained monotone equations with application (Q6582394) (← links)
- Accelerated nonmonotone line search technique for multiobjective optimization (Q6593954) (← links)
- Hypergraph-based convex semi-supervised unconstraint symmetric matrix factorization for image clustering (Q6595309) (← links)
- Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm (Q6601376) (← links)
- Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization (Q6606853) (← links)
- New gradient methods with adaptive stepsizes by approximate models (Q6611221) (← links)
- Two efficient nonlinear conjugate gradient methods for Riemannian manifolds (Q6623450) (← links)
- An extended version of the memoryless DFP algorithm with the sufficient descent property (Q6634291) (← links)
- Globally linearly convergent nonlinear conjugate gradients without Wolfe line search (Q6653267) (← links)
- An active set method for bound-constrained optimization (Q6661109) (← links)
- A family of limited memory three term conjugate gradient methods (Q6661110) (← links)
