CUTEr

swMATH4010MaRDI QIDQ16200FDOQ16200

Author name not available (Why is that?)

Official website: http://www.cuter.rl.ac.uk/

Described by source

• CUTEr and SifDec

Cited In (only showing first 100 items - show all)

• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• A globally convergent penalty-free method for optimization with equality constraints and simple bounds
• Spectral method and its application to the conjugate gradient method
• The cyclic Barzilai-–Borwein method for unconstrained optimization
• A family of second-order methods for convex \(\ell _1\)-regularized optimization
• The optimization test environment
• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• The convergence of conjugate gradient method with nonmonotone line search
• A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
• Global and local convergence of a class of penalty-free-type methods for nonlinear programming
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• A modified PRP conjugate gradient method
• An inexact Newton method for nonconvex equality constrained optimization
• Nonlinear programming without a penalty function or a filter
• Recognizing underlying sparsity in optimization
• Computing sparse Hessians with automatic differentiation
• Trust-region and other regularisations of linear least-squares problems
• Optimization theory and methods. Nonlinear programming
• Scaled conjugate gradient algorithms for unconstrained optimization
• An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
• An interior-point algorithm for large-scale nonlinear optimization with inexact step computations
• A numerical study of limited memory BFGS methods
• Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Second-order negative-curvature methods for box-constrained and general constrained optimization
• Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
• Another hybrid conjugate gradient algorithm for unconstrained optimization
• A repository of convex quadratic programming problems
• Solving the Trust-Region Subproblem using the Lanczos Method
• OrthoMADS
• Algorithm 738
• MCPLIB
• BB
• QPOPT
• UOBYQA
• DEVEX
• TOLMIN
• COPS
• NLPQL
• MSS
• SCALCG
• CUTE
• OPAL
• ZQPCVX
• CTA
• OSL
• CGOPT
• Optimization Toolbox
• edge_push_sp
• hess_pat
• NETLIB LP Test Set
• JiffyTune
• CUTEst
• Global Optimization Test
• AD01
• MA27
• QPLIB2014
• QL
• MA47
• CUTE
• NLPIP
• GTOP
• Algorithm 709
• LINUOA
• Boosters
• ACGSSV
• ORBIT
• Optimization Test Environment
• LSA
• CutEr
• Algorithm 566
• PPCG_lrep
• f2c
• MMLA1Q
• heapsort
• GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
• CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm
• Optimization of algorithms with OPAL
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
• HSL-VF05
• NSOIA
• quadprogIP
• SDMINMAX
• JuliaStats
• Numerical solution of saddle point problems
• Improving ultimate convergence of an augmented Lagrangian method
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
• qpOASES: a parametric active-set algorithm for~quadratic programming
• Dynamic Control of Infeasibility in Equality Constrained Optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
• Symmetric Perry conjugate gradient method
• Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
• Some descent three-term conjugate gradient methods and their global convergence
• Algorithm 943: MSS: MATLAB software for L-BFGS trust-region subproblems for large-scale optimization
• A coordinate gradient descent method for nonsmooth separable minimization
• Acceleration of conjugate gradient algorithms for unconstrained optimization
• Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
• Numerical expirience with a class of self-scaling quasi-Newton algorithms

This page was built for software: CUTEr