The following pages link to CUTEr (Q16200):
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)
- Some modified conjugate gradient methods for unconstrained optimization (Q277201) (← links)
- New hybrid conjugate gradient method for unconstrained optimization (Q278565) (← links)
- Spectral method and its application to the conjugate gradient method (Q279183) (← links)
- Trust region algorithm with two subproblems for bound constrained problems (Q279647) (← links)
- An optimal parameter for Dai-Liao family of conjugate gradient methods (Q289129) (← links)
- A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints (Q295355) (← links)
- A modified scaling parameter for the memoryless BFGS updating formula (Q297561) (← links)
- A stabilized filter SQP algorithm for nonlinear programming (Q312472) (← 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 self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization (Q370232) (← links)
- A restoration-free filter SQP algorithm for equality constrained optimization (Q371507) (← links)
- Symmetric Perry conjugate gradient method (Q377723) (← links)
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization (Q377728) (← links)
- A practical relative error criterion for augmented Lagrangians (Q378086) (← links)
- A penalty-free method for equality constrained optimization (Q380463) (← links)
- Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization (Q380494) (← links)
- A nonmonotone retrospective trust-region method for unconstrained optimization (Q380526) (← links)
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization (Q382920) (← links)
- Two modified scaled nonlinear conjugate gradient methods (Q390466) (← links)
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization (Q396257) (← links)
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
- Sobolev seminorm of quadratic functions with applications to derivative-free optimization (Q403635) (← links)
- Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian (Q409817) (← 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)
- A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization (Q421813) (← links)
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization (Q429499) (← links)
- How good are extrapolated bi-projection methods for linear feasibility problems? (Q429520) (← links)
- Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property (Q433285) (← links)
- A primal-dual augmented Lagrangian (Q434173) (← links)
- TRESNEI, a MATLAB trust-region solver for systems of nonlinear equalities and inequalities (Q434175) (← 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)
- Recent advances in algorithmic differentiation. Selected papers based on the presentations at the 6th international conference on automatic differentiation (AD2012), Fort Collins, CO, USA, July 23--27, 2012. (Q444619) (← links)
- Global convergence of a spectral conjugate gradient method for unconstrained optimization (Q448802) (← links)
- A combined class of self-scaling and modified quasi-Newton methods (Q453615) (← links)
- Interior-point methods for nonconvex nonlinear programming: cubic regularization (Q457205) (← links)
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
