CUTEr
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
- Recognizing underlying sparsity in optimization
- Two modified Dai-Yuan nonlinear conjugate gradient methods
- Trust-region and other regularisations of linear least-squares problems
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results
- A modified PRP conjugate gradient method
- 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
- New quasi-Newton equation and related methods for unconstrained optimization
- GLOPT
- KNITRO
- LANCELOT
- MA57
- NEWUOA
- Corrected sequential linear programming for sparse minimax optimization
- PSwarm
- QPDO
- SIPAMPL
- SLMQN
- Numerical experiences with new truncated Newton methods in large scale unconstrained optimization
- SPG
- Recent progress in unconstrained nonlinear optimization without derivatives
- STENMIN
- STRSCNE
- TENSOLVE
- TNPACK
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- PREQN
- L-BFGS-B
- Combining search directions using gradient flows
- Feasible interior methods using slacks for nonlinear optimization
- GALAHAD
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
- LOQO
- SNOPT
- CONDOR
- CONOPT
- NOMAD
- L-BFGS
- Convergence of the nonmonotone Perry and Shanno method for optimization
- Advances in design and implementation of optimization software
- On the behavior of the gradient norm in the steepest descent method
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization
- AMPL
- testenv
- LIBOPT
- 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
- FSQP
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- A new regularized quasi-Newton algorithm for unconstrained optimization
- Best practices for comparing optimization algorithms
- QPA
- Two accelerated nonmonotone adaptive trust region line search methods
- Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
- An improved Perry conjugate gradient method with adaptive parameter choice
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
- APPSPACK
- Algorithm 739
- DAFNE
- Line search filter inexact secant methods for nonlinear equality constrained optimization
- A class of one parameter conjugate gradient methods
- A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization
- A spectral dai-yuan-type conjugate gradient method for unconstrained optimization
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
- A double parameter scaled BFGS method for unconstrained optimization
- GLOBALLib
- LIPSOL
- TRON
- UFO
- filterSQP
- LSTRS
- DFO
- CONMIN
- OOQP
- NNLS
- MINPACK-2
- TANGO
- BOBYQA
- WEDGE
- ipfilter
- CONV_QP
- Ipopt
- levmar
- On the nonmonotonicity degree of nonmonotone line searches
- QP
- CG_DESCENT
This page was built for software: CUTEr
