Cited in
(only showing first 100 items - show all)- Spectral method and its application to the conjugate gradient method
- An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
- Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
- On Hager and Zhang's conjugate gradient method with guaranteed descent
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- An inexact Newton method for nonconvex equality constrained optimization
- Scaled conjugate gradient algorithms for unconstrained optimization
- An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- A conic trust-region method and its convergence properties
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Algorithm 851
- New hybrid conjugate gradient method for unconstrained optimization
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Scaled memoryless symmetric rank one method for large-scale optimization
- The convergence of conjugate gradient method with nonmonotone line search
- A numerical study of limited memory BFGS methods
- Globally convergent modified Perry's conjugate gradient method
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- LANCELOT
- SPG
- L-BFGS-B
- GALAHAD
- L-BFGS
- CUTEr
- NLPQLP
- Algorithm 739
- DAFNE
- CONMIN
- Spectral scaling BFGS method
- CG_DESCENT
- ipfilter
- MINPACK-2
- NNLS
- levmar
- MINOPT
- TRON
- UFO
- FFSQP(f77)
- MPSreader
- Algorithm 500
- minpack
- tn
- ve08
- BQPD
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- GQTPAR
- QPOPT
- COPS
- MSS
- SCALCG
- ZQPCVX
- OSL
- edge_push_sp
- hess_pat
- MA27
- QPLIB2014
- QL
- NLPIP
- Algorithm 709
- LINUOA
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Algorithm 943: MSS: MATLAB software for L-BFGS trust-region subproblems for large-scale optimization
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- ACGSSV
- LSA
- NLPNET
- Algorithm 566
- PPCG_lrep
- MMLA1Q
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
- Improved Hessian approximation with modified secant equations for symmetric rank-one method
- A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
- A repository of convex quadratic programming problems
- An implementation of Shor's \(r\)-algorithm
- A dwindling filter line search method for unconstrained optimization
- Recent progress in unconstrained nonlinear optimization without derivatives
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds
- Global convergence of some modified PRP nonlinear conjugate gradient methods
- SIFDecode
- Augmented Lagrangian applied to convex quadratic problems
- Nonmonotone curvilinear line search methods for unconstrained optimization
- A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization
- Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization
- A truncated descent HS conjugate gradient method and its global convergence
- Nonconvex optimization using negative curvature within a modified linesearch
This page was built for software: CUTE
