The following pages link to CUTEr (Q16200):
Displaying 50 items.
- A trust region affine scaling method for bound constrained optimization (Q1942658) (← links)
- Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
- A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties (Q1949585) (← links)
- A filter algorithm with inexact line search (Q1954692) (← links)
- Reverse bridge theorem under constraint partition (Q1958870) (← links)
- Combining cross-entropy and MADS methods for inequality constrained global optimization (Q1981930) (← links)
- A new modified BFGS method for unconstrained optimization problems (Q1993498) (← links)
- A modified nonlinear conjugate gradient method with the Armijo line search and its application (Q2007123) (← links)
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization (Q2007164) (← links)
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length (Q2009059) (← links)
- A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem (Q2009756) (← links)
- Some nonlinear conjugate gradient methods based on spectral scaling secant equations (Q2013630) (← links)
- Derivative-free restrictively preconditioned conjugate gradient path method without line search technique for solving linear equality constrained optimization (Q2013811) (← links)
- A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations (Q2013818) (← links)
- A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q2017614) (← links)
- Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems (Q2028038) (← links)
- An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing (Q2034433) (← links)
- A spectral three-term Hestenes-Stiefel conjugate gradient method (Q2040607) (← links)
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization (Q2041515) (← links)
- Compact representations of structured BFGS matrices (Q2044571) (← links)
- A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update (Q2052328) (← links)
- Two nonmonotone trust region algorithms based on an improved Newton method (Q2053070) (← links)
- Two limited-memory optimization methods with minimum violation of the previous secant conditions (Q2057221) (← links)
- The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique (Q2067951) (← links)
- Least-squares-based three-term conjugate gradient methods (Q2069298) (← links)
- A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems (Q2072782) (← links)
- Two improved nonlinear conjugate gradient methods with the strong Wolfe line search (Q2079812) (← links)
- Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing (Q2083385) (← links)
- Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems (Q2088792) (← links)
- A three-term conjugate gradient method with accelerated subspace quadratic optimization (Q2089194) (← links)
- A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction (Q2091131) (← links)
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
- Two classes of spectral conjugate gradient methods for unconstrained optimizations (Q2103158) (← links)
- Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems (Q2103178) (← links)
- 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 (Q2104056) (← links)
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
- A reduced proximal-point homotopy method for large-scale non-convex BQP (Q2114822) (← links)
- Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing (Q2116059) (← links)
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
- Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization (Q2125037) (← links)
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations (Q2125067) (← links)
- Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property (Q2129100) (← links)
- A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization (Q2129634) (← links)
- A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection (Q2133373) (← links)
- A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization (Q2140823) (← links)
- An extended projected residual algorithm for solving smooth convex optimization problems (Q2141614) (← links)
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing (Q2142552) (← links)
- Optimal scaling parameters for spectral conjugate gradient methods (Q2153393) (← links)
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration (Q2163451) (← links)
- The global convergence of the BFGS method with a modified WWP line search for nonconvex functions (Q2163462) (← links)
