The following pages link to CUTE (Q26578):
Displaying 42 items.
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization (Q2515066) (← links)
- A new method of moving asymptotes for large-scale unconstrained optimization (Q2518690) (← links)
- A new family of conjugate gradient methods (Q2519734) (← links)
- Nonlinear analysis: optimization methods, convergence theory, and applications (Q2520483) (← links)
- Corrigendum to: ``Krasnosel'skii type hybrid fixed point theorems and their applications to fractional integral equations'' (Q2520484) (← links)
- A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems (Q2633254) (← links)
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization (Q2643614) (← links)
- Global and local R-linear convergence of a spectral projected gradient method for convex optimization with singular solution (Q2827859) (← links)
- New conjugate gradient method for unconstrained optimization (Q2954367) (← links)
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition (Q2969958) (← links)
- (Q2975072) (← links)
- Derivative-free nonlinear optimization filter simplex (Q3083910) (← links)
- An active-set algorithm for nonlinear programming using parametric linear programming (Q3093034) (← links)
- (Q3415748) (← links)
- Algorithm 851 (Q3549169) (← links)
- A new family of penalties for augmented Lagrangian methods (Q3588894) (← links)
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization (Q4372656) (← links)
- A repository of convex quadratic programming problems (Q4504798) (← links)
- An optimal control framework for dynamic induction control of wind farms and their interaction with the atmospheric boundary layer (Q4560639) (← links)
- Globally convergence of nonlinear conjugate gradient method for unconstrained optimization (Q4578161) (← links)
- A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q4638925) (← links)
- A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization (Q4960453) (← links)
- Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization (Q4989938) (← links)
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization (Q5028578) (← links)
- The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations (Q5031714) (← links)
- Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem (Q5038438) (← links)
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
- A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization (Q5085236) (← links)
- Global convergence of a modified Fletcher–Reeves conjugate gradient method with Wolfe line search (Q5113081) (← links)
- A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization (Q5151541) (← links)
- A Simulated Annealing-Based Barzilai–Borwein Gradient Method for Unconstrained Optimization Problems (Q5193216) (← links)
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs (Q5216730) (← links)
- Adaptive, Limited-Memory BFGS Algorithms for Unconstrained Optimization (Q5231665) (← links)
- Algorithm 943 (Q5270699) (← links)
- (Q5298778) (← links)
- A modified Hestenes–Stiefel conjugate gradient method with an optimal property (Q5379461) (← links)
- A New Diagonal Quasi-Newton Updating Method With Scaled Forward Finite Differences Directional Derivative for Unconstrained Optimization (Q5384612) (← links)
- A dwindling filter line search method for unconstrained optimization (Q5497020) (← links)
- Computing the sparsity pattern of Hessians using automatic differentiation (Q5498686) (← links)
- A one-parameter class of three-term conjugate gradient methods with an adaptive parameter choice (Q5858994) (← links)
- Higher-order reverse automatic differentiation with emphasis on the third-order (Q5962714) (← links)
- Publication:5028578 (← links)
