The following pages link to CUTEr (Q16200):
Displaying 50 items.
- Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization (Q2171075) (← links)
- Two new conjugate gradient methods for unconstrained optimization (Q2179153) (← links)
- Diagonal approximation of the Hessian by finite differences for unconstrained optimization (Q2188948) (← links)
- A class of accelerated conjugate-gradient-like methods based on a modified secant equation (Q2190281) (← links)
- New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method (Q2190791) (← links)
- A double parameter self-scaling memoryless BFGS method for unconstrained optimization (Q2190850) (← links)
- A comparison of methods for traversing regions of non-convexity in optimization problems (Q2192582) (← links)
- A modified scaled memoryless symmetric rank-one method (Q2193423) (← links)
- A spectral conjugate gradient method for solving large-scale unconstrained optimization (Q2203770) (← links)
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization (Q2204182) (← links)
- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement (Q2218908) (← links)
- A survey of gradient methods for solving nonlinear optimization (Q2220680) (← links)
- Diagonal quasi-Newton methods via least change updating principle with weighted Frobenius norm (Q2225525) (← links)
- A novel value for the parameter in the Dai-Liao-type conjugate gradient method (Q2228067) (← links)
- Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing (Q2243965) (← links)
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction (Q2244998) (← links)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
- An inexact and nonmonotone proximal method for smooth unconstrained minimization (Q2252253) (← links)
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
- Nonmonotone adaptive trust region method with line search based on new diagonal updating (Q2261939) (← links)
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q2267641) (← links)
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search (Q2290291) (← links)
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization (Q2301132) (← links)
- Some three-term conjugate gradient methods with the new direction structure (Q2301307) (← links)
- An improved nonmonotone adaptive trust region method. (Q2315468) (← links)
- A modified spectral conjugate gradient method with global convergence (Q2317848) (← links)
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization (Q2322338) (← links)
- A dense initialization for limited-memory quasi-Newton methods (Q2322555) (← links)
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function (Q2327437) (← links)
- 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 (Q2336064) (← links)
- A hybrid conjugate gradient method with descent property for unconstrained optimization (Q2337555) (← links)
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q2338474) (← links)
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization (Q2340488) (← links)
- A nonmonotone hybrid conjugate gradient method for unconstrained optimization (Q2340982) (← links)
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization (Q2346397) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (Q2352415) (← links)
- Optimality properties of an augmented Lagrangian method on infeasible problems (Q2352419) (← links)
- An adaptive sizing BFGS method for unconstrained optimization (Q2355301) (← links)
- A modified Perry conjugate gradient method and its global convergence (Q2355321) (← links)
- The optimization test environment (Q2357211) (← links)
- A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization (Q2358024) (← links)
- A nonmonotone inexact Newton method for unconstrained optimization (Q2359404) (← links)
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update (Q2359995) (← links)
- A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization (Q2360814) (← links)
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q2363570) (← links)
- A globally convergent hybrid conjugate gradient method and its numerical behaviors (Q2375413) (← links)
- An inexact restoration strategy for the globalization of the sSQP method (Q2377163) (← links)
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization (Q2378276) (← links)
- A truncated Newton method in an augmented Lagrangian framework for nonlinear programming (Q2379687) (← links)
