The following pages link to CUTE (Q4371578):
Displaying 50 items.
- 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)
- Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization (Q670492) (← links)
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming (Q693410) (← links)
- A nonmonotone filter method for nonlinear optimization (Q694518) (← links)
- Scaled memoryless symmetric rank one method for large-scale optimization (Q720629) (← links)
- Some three-term conjugate gradient methods with the inexact line search condition (Q723556) (← links)
- A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations (Q724489) (← links)
- A trajectory-based method for constrained nonlinear optimization problems (Q725880) (← links)
- A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization (Q747220) (← links)
- A conjugate gradient method with sufficient descent property (Q747726) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
- An inexact Newton method for nonconvex equality constrained optimization (Q847853) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- Sufficient descent nonlinear conjugate gradient methods with conjugacy condition (Q849150) (← links)
- Local convergence of an inexact-restoration method and numerical experiments (Q850815) (← links)
- A modified quasi-Newton method for structured optimization with partial information on the Hessian (Q853668) (← links)
- Monotone projected gradient methods for large-scale box-constrained quadratic programming (Q862715) (← links)
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q870176) (← links)
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q878996) (← links)
- An adaptive trust region method based on simple conic models (Q894560) (← links)
- An active-set projected trust region algorithm for box constrained optimization problems (Q905153) (← links)
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization (Q929334) (← links)
- Augmented Lagrangian applied to convex quadratic problems (Q932544) (← links)
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization (Q946337) (← links)
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q955062) (← links)
- A conjugate gradient method for unconstrained optimization problems (Q963493) (← links)
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization (Q970585) (← links)
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization (Q979866) (← links)
- Notes on the Dai-Yuan-Yuan modified spectral gradient method (Q984907) (← links)
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints (Q985699) (← links)
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization (Q989146) (← links)
- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems (Q1004008) (← links)
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
- A limited memory BFGS-type method for large-scale unconstrained optimization (Q1004767) (← links)
- Global convergence of quasi-Newton methods based on adjoint Broyden updates (Q1012254) (← links)
- Two modified Dai-Yuan nonlinear conjugate gradient methods (Q1014353) (← links)
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization (Q1026434) (← links)
- A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results (Q1026441) (← links)
- Hybrid conjugate gradient algorithm for unconstrained optimization (Q1028610) (← links)
- Acceleration of conjugate gradient algorithms for unconstrained optimization (Q1029371) (← links)
- A conic trust-region method and its convergence properties (Q1029835) (← links)
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← links)
- A truncated descent HS conjugate gradient method and its global convergence (Q1036485) (← links)
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation (Q1039699) (← links)
