The following pages link to CUTE (Q26578):
Displaying 50 items.
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds (Q267115) (← links)
- An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property (Q267707) (← links)
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method (Q272460) (← links)
- Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization (Q272601) (← links)
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity (Q273251) (← links)
- On Hager and Zhang's conjugate gradient method with guaranteed descent (Q273329) (← links)
- New hybrid conjugate gradient method for unconstrained optimization (Q278565) (← links)
- Spectral method and its application to the conjugate gradient method (Q279183) (← links)
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (Q283997) (← links)
- A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints (Q295355) (← links)
- A family of second-order methods for convex \(\ell _1\)-regularized optimization (Q312690) (← links)
- Primal and dual active-set methods for convex quadratic programming (Q312693) (← links)
- An active set truncated Newton method for large-scale bound constrained optimization (Q316586) (← links)
- On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems (Q356122) (← links)
- An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems (Q364742) (← links)
- A restoration-free filter SQP algorithm for equality constrained optimization (Q371507) (← links)
- A practical relative error criterion for augmented Lagrangians (Q378086) (← links)
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
- Scaling on diagonal quasi-Newton update for large-scale unconstrained optimization (Q411967) (← links)
- A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties (Q415335) (← links)
- Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property (Q433285) (← links)
- A primal-dual augmented Lagrangian (Q434173) (← links)
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization (Q438775) (← links)
- Globally convergent modified Perry's conjugate gradient method (Q440856) (← links)
- The global convergence of a descent PRP conjugate gradient method (Q441785) (← links)
- Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization (Q442712) (← links)
- Global convergence of a spectral conjugate gradient method for unconstrained optimization (Q448802) (← links)
- Interior-point methods for nonconvex nonlinear programming: cubic regularization (Q457205) (← links)
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization (Q480926) (← links)
- A limited memory descent Perry conjugate gradient method (Q518141) (← links)
- Dai-Kou type conjugate gradient methods with a line search only using gradient (Q522525) (← links)
- A modified three-term PRP conjugate gradient algorithm for optimization models (Q527794) (← links)
- An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments (Q531641) (← links)
- Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
- A modified CG-DESCENT method for unconstrained optimization (Q535462) (← links)
- A robust implementation of a sequential quadratic programming algorithm with successive error restoration (Q537640) (← links)
- A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization (Q555476) (← links)
- Spectral scaling BFGS method (Q604256) (← links)
- The convergence of conjugate gradient method with nonmonotone line search (Q606706) (← links)
- A simple sufficient descent method for unconstrained optimization (Q613840) (← links)
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization (Q627582) (← links)
- Improved Hessian approximation with modified secant equations for symmetric rank-one method (Q629505) (← links)
- Global convergence of some modified PRP nonlinear conjugate gradient methods (Q644512) (← links)
- A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization (Q646746) (← links)
- A symmetric rank-one method based on extra updating techniques for unconstrained optimization (Q651495) (← links)
- A sufficient descent LS conjugate gradient method for unconstrained optimization problems (Q654620) (← links)
- A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
- Global convergence of a nonmonotone trust region algorithm with memory for unconstrained optimization (Q662127) (← links)
- Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search (Q662895) (← links)
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction (Q668710) (← links)
