The following pages link to CUTE (Q4371578):
Displayed 50 items.
- A new nonmonotone trust-region method of conic model for solving unconstrained optimization (Q2654183) (← links)
- An efficient projection-based algorithm without Lipschitz continuity for large-scale nonlinear pseudo-monotone equations (Q2667105) (← links)
- A decent three term conjugate gradient method with global convergence properties for large scale unconstrained optimization problems (Q2671105) (← links)
- Computational experiments with scaled initial hessian approximation for the broyden family methods<sup>∗</sup> (Q2709452) (← links)
- A nonmonotone Broyden method for unconstrained optimization (Q2778682) (← links)
- A sufficient descent Liu–Storey conjugate gradient method and its global convergence (Q2808326) (← links)
- A sufficient descent conjugate gradient method and its global convergence (Q2815547) (← links)
- AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION (Q2846484) (← links)
- A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization (Q2854330) (← links)
- A new framework for the computation of Hessians (Q2885473) (← links)
- Shifted L-BFGS systems (Q2926066) (← links)
- Cubic overestimation and secant updating for unconstrained optimization of<i>C</i><sup>2, 1</sup>functions (Q2926071) (← links)
- An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization (Q2926081) (← links)
- New three-term conjugate gradient method with guaranteed global convergence (Q2935391) (← links)
- A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea (Q2943838) (← links)
- New conjugate gradient method for unconstrained optimization (Q2954367) (← links)
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition (Q2969958) (← links)
- An Affine Scaling Interior Point Filter Line-Search Algorithm for Linear Inequality Constrained Minimization (Q3058365) (← links)
- A Framework for Simulating and Estimating the State and Functional Topology of Complex Dynamic Geometric Networks (Q3070787) (← links)
- Derivative-free nonlinear optimization filter simplex (Q3083910) (← links)
- Structured symmetric rank-one method for unconstrained optimization (Q3101645) (← links)
- On the performance of switching BFGS/SR1 algorithms for unconstrained optimization (Q3156720) (← links)
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization (Q3369520) (← links)
- A preconditioner for solving large-scale variational inequality problems by a semismooth inexact approach (Q3427664) (← links)
- An augmented Lagrangian affine scaling method for nonlinear programming (Q3458825) (← links)
- A scaled nonlinear conjugate gradient algorithm for unconstrained optimization (Q3514834) (← links)
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization (Q3539795) (← links)
- A NONMONOTONE FILTER BARZILAI-BORWEIN METHOD FOR OPTIMIZATION (Q3560107) (← links)
- A CONVEX APPROXIMATION METHOD FOR LARGE SCALE LINEAR INEQUALITY CONSTRAINED MINIMIZATION (Q3560110) (← links)
- The Sequential Quadratic Programming Method (Q3569505) (← links)
- A new family of penalties for augmented Lagrangian methods (Q3588894) (← links)
- Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization (Q3643085) (← links)
- Derivative-free optimization and filter methods to solve nonlinear constrained problems (Q3643170) (← links)
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization (Q4372656) (← links)
- LOQO:an interior point code for quadratic programming (Q4504789) (← links)
- A repository of convex quadratic programming problems (Q4504798) (← links)
- SDPLIB 1.2, a library of semidefinite programming test problems (Q4504799) (← 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)
- An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method (Q4631766) (← links)
- A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q4638925) (← links)
- A matrix-free line-search algorithm for nonconvex optimization (Q4646671) (← links)
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks (Q4657813) (← links)
- Solving mathematical programs with complementarity constraints as nonlinear programs (Q4673321) (← links)
- A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization (Q4899102) (← links)
- A class of diagonal preconditioners for limited memory BFGS method (Q4924122) (← links)
- A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization (Q4960453) (← links)
- Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization (Q4989938) (← links)
- MULTIPLE USE OF BACKTRACKING LINE SEARCH IN UNCONSTRAINED OPTIMIZATION (Q5011305) (← links)
- A NEW THREE–TERM CONJUGATE GRADIENT METHOD WITH DESCENT DIRECTION FOR UNCONSTRAINED OPTIMIZATION (Q5011628) (← links)