CUTEr and SifDec
From MaRDI portal
Recommendations
- CUTE
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- The relative cost of function and derivative evaluations in the CUTEr test set
- The optimization test environment
Cited in
(only showing first 100 items - show all)- Recognizing underlying sparsity in optimization
- Trust-region and other regularisations of linear least-squares problems
- A modified PRP conjugate gradient method
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization
- CUTEr
- SIFDecode
- A new regularized quasi-Newton algorithm for unconstrained optimization
- Best practices for comparing optimization algorithms
- 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
- Line search filter inexact secant methods for nonlinear equality constrained optimization
- A spectral dai-yuan-type conjugate gradient method for unconstrained optimization
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
- On the nonmonotonicity degree of nonmonotone line searches
- On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints
- A nonmonotone weighting self-adaptive trust region algorithm for unconstrained nonconvex optimization
- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints
- An indicator for the switch from derivative-free to derivative-based optimization
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- MINQ8: general definite and bound constrained indefinite quadratic programming
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A primal-dual regularized interior-point method for convex quadratic programs
- Two adaptive Dai-Liao nonlinear conjugate gradient methods
- Evaluating bound-constrained minimization software
- An active set feasible method for large-scale minimization problems with bound constraints
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- Efficient use of parallelism in algorithmic parameter optimization applications
- On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds
- A trust region affine scaling method for bound constrained optimization
- Benchmarking nonlinear optimization software in technical computing environments
- Combining cross-entropy and MADS methods for inequality constrained global optimization
- A new modified BFGS method for unconstrained optimization problems
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
- A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations
- A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems
- An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- Compact representations of structured BFGS matrices
- A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update
- Two nonmonotone trust region algorithms based on an improved Newton method
- The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique
- A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
- Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing
- A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
- Two classes of spectral conjugate gradient methods for unconstrained optimizations
- Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations
- A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization
- An extended projected residual algorithm for solving smooth convex optimization problems
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- Optimal scaling parameters for spectral conjugate gradient methods
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model
- A hybrid quasi-Newton method with application in sparse recovery
- A comparison of methods for traversing regions of non-convexity in optimization problems
- A modified scaled memoryless symmetric rank-one method
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement
- Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- Nonmonotone adaptive trust region method with line search based on new diagonal updating
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- An improved nonmonotone adaptive trust region method.
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- A dense initialization for limited-memory quasi-Newton methods
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
- An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- A nonmonotone hybrid conjugate gradient method for unconstrained optimization
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- Recent advances in trust region algorithms
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Optimality properties of an augmented Lagrangian method on infeasible problems
- The optimization test environment
- A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization
- A nonmonotone inexact Newton method for unconstrained optimization
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- A globally convergent hybrid conjugate gradient method and its numerical behaviors
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
- A new trust region filter algorithm
- A truncated Newton method in an augmented Lagrangian framework for nonlinear programming
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- A penalty-interior-point algorithm for nonlinear constrained optimization
- On efficiently combining limited-memory and trust-region techniques
- A frame-based conjugate gradients direct search method with radial basis function interpolation model
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- A comparison of reduced and unreduced KKT systems arising from interior point methods
- Spectral analysis of the preconditioned system for the 3 3 block saddle point problem
Describes a project that uses
Uses Software
This page was built for publication: CUTEr and SifDec
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5461068)
