CUTE
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
- Global convergence of quasi-Newton methods based on adjoint Broyden updates
- Two modified Dai-Yuan nonlinear conjugate gradient methods
- A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- A conic trust-region method and its convergence properties
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- A truncated descent HS conjugate gradient method and its global convergence
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- Numerical expirience with a class of self-scaling quasi-Newton algorithms
- A framework for globally convergent algorithms using gradient bounding functions
- LANCELOT
- Corrected sequential linear programming for sparse minimax optimization
- SPG
- Recent progress in unconstrained nonlinear optimization without derivatives
- L-BFGS-B
- GALAHAD
- An implementation of Shor's \(r\)-algorithm
- L-BFGS
- Advances in design and implementation of optimization software
- CUTEr
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- NLPQLP
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- SIFDecode
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- Best practices for comparing optimization algorithms
- An improved Perry conjugate gradient method with adaptive parameter choice
- Algorithm 739
- DAFNE
- A class of one parameter conjugate gradient methods
- A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search
- TRON
- UFO
- CONMIN
- NNLS
- MINPACK-2
- ipfilter
- levmar
- CG_DESCENT
- MINOPT
- On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints
- Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization
- A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions
- A modified conjugacy condition and related nonlinear conjugate gradient method
- MPSreader
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
- A hybrid of DL and WYL nonlinear conjugate gradient methods
- tn
- ve08
- FFSQP(f77)
- Algorithm 500
- An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables
- minpack
- Conjugate gradient methods using value of objective function for unconstrained optimization
- A starting point strategy for nonlinear interior methods.
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- A new family of conjugate gradient methods for unconstrained optimization
- Nonmonotone curvilinear line search methods for unconstrained optimization
- BQPD
- A numerical study of limited memory BFGS methods
- Inertia-controlling factorizations for optimization algorithms
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- Computational experience with penalty-barrier methods for nonlinear programming
- A note on the implementation of an interior-point algorithm for nonlinear optimization with inexact step computations
- A regularized Newton method for degenerate unconstrained optimization problems
- Evaluating bound-constrained minimization software
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- Descentwise inexact proximal algorithms for smooth optimization
- GQTPAR
- Benchmarking nonlinear optimization software in technical computing environments
- A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties
- A filter algorithm with inexact line search
- Reverse bridge theorem under constraint partition
- QPOPT
- A modified nonlinear conjugate gradient method with the Armijo line search and its application
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem
- Some nonlinear conjugate gradient methods based on spectral scaling secant equations
- Derivative-free restrictively preconditioned conjugate gradient path method without line search technique for solving linear equality constrained optimization
- A spectral three-term Hestenes-Stiefel conjugate gradient method
- SCALCG
- ZQPCVX
- COPS
- MSS
- Two limited-memory optimization methods with minimum violation of the previous secant conditions
- The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique
- Least-squares-based three-term conjugate gradient methods
- Two improved nonlinear conjugate gradient methods with the strong Wolfe line search
- Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems
- A three-term conjugate gradient method with accelerated subspace quadratic optimization
- Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems
- An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems
- A reduced proximal-point homotopy method for large-scale non-convex BQP
- Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization
This page was built for software: CUTE
