The following pages link to CUTE (Q26578):
Displaying 50 items.
- A double parameter self-scaling memoryless BFGS method for unconstrained optimization (Q2190850) (← links)
- A spectral conjugate gradient method for solving large-scale unconstrained optimization (Q2203770) (← 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)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← 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)
- Some three-term conjugate gradient methods with the new direction structure (Q2301307) (← links)
- A modified spectral conjugate gradient method with global convergence (Q2317848) (← 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)
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (Q2352415) (← links)
- An adaptive sizing BFGS method for unconstrained optimization (Q2355301) (← links)
- A modified Perry conjugate gradient method and its global convergence (Q2355321) (← links)
- A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization (Q2360814) (← links)
- A globally convergent hybrid conjugate gradient method and its numerical behaviors (Q2375413) (← links)
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization (Q2390003) (← links)
- Global convergence and the Powell singular function (Q2392109) (← links)
- A penalty-interior-point algorithm for nonlinear constrained optimization (Q2392661) (← links)
- \(n\)-step quadratic convergence of a restart Liu-Storey type method (Q2392968) (← links)
- Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
- Global convergence of a modified conjugate gradient method (Q2405656) (← links)
- PAL-Hom method for QP and an application to LP (Q2419548) (← links)
- Gradient method with multiple damping for large-scale unconstrained optimization (Q2421450) (← links)
- A new method of moving asymptotes for large-scale linearly equality-constrained minimization (Q2431059) (← links)
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search (Q2433993) (← links)
- A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization (Q2436686) (← links)
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization (Q2448155) (← links)
- A conjugate directions approach to improve the limited-memory BFGS method (Q2449186) (← links)
- Improving solver success in reaching feasibility for sets of nonlinear constraints (Q2459379) (← links)
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification (Q2467167) (← links)
- A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization (Q2469707) (← links)
- On the method of shortest residuals for unconstrained optimization (Q2471088) (← links)
- Scaled conjugate gradient algorithms for unconstrained optimization (Q2477015) (← links)
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization (Q2479826) (← links)
- Self-adaptive inexact proximal point methods (Q2479838) (← links)
- A trust region method for optimization problem with singular solutions (Q2480784) (← links)
- Another hybrid conjugate gradient algorithm for unconstrained optimization (Q2481406) (← links)
- Nonconvex optimization using negative curvature within a modified linesearch (Q2482748) (← links)
- Two descent hybrid conjugate gradient methods for optimization (Q2483351) (← links)
- An interior algorithm for nonlinear optimization that combines line search and trust region steps (Q2492700) (← links)
- Convergence of nonmonotone line search method (Q2493941) (← links)
- Mathematical programming models and algorithms for engineering design optimization (Q2495616) (← links)
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion (Q2502232) (← links)
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization (Q2503148) (← links)
- Some sufficient descent conjugate gradient methods and their global convergence (Q2514055) (← links)
- A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization (Q2514657) (← links)
