The following pages link to CUTEr (Q16200):
Displaying 50 items.
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction (Q668710) (← links)
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396) (← 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)
- Updating the regularization parameter in the adaptive cubic regularization algorithm (Q694543) (← links)
- A filter trust-region algorithm for unconstrained optimization with strong global convergence properties (Q694595) (← links)
- Numerical experiments with an interior-exterior point method for nonlinear programming (Q702481) (← links)
- Convergence analysis of a modified BFGS method on convex minimizations (Q711385) (← links)
- A limited memory steepest descent method (Q715093) (← links)
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization (Q715240) (← links)
- Scaled memoryless symmetric rank one method for large-scale optimization (Q720629) (← links)
- A modified nonmonotone trust region line search method (Q721572) (← links)
- Some three-term conjugate gradient methods with the inexact line search condition (Q723556) (← links)
- A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique (Q723782) (← links)
- A trajectory-based method for constrained nonlinear optimization problems (Q725880) (← links)
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming (Q732237) (← links)
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization (Q732778) (← links)
- A regularized Newton method without line search for unconstrained optimization (Q742310) (← links)
- A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization (Q743777) (← links)
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization (Q745223) (← 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)
- A modified BFGS algorithm based on a hybrid secant equation (Q763667) (← 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)
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems (Q813367) (← links)
- Sensitivity of trust-region algorithms to their parameters (Q816577) (← links)
- Variable parameter Uzawa method for solving a class of block three-by-three saddle point problems (Q827073) (← links)
- Starting-point strategies for an infeasible potential reduction method (Q845561) (← links)
- Nonlinear programming without a penalty function or a filter (Q847849) (← 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 modified nearly exact method for solving low-rank trust region subproblem (Q868456) (← links)
- A note on the use of vector barrier parameters for interior-point methods (Q877030) (← 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)
- A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems (Q896192) (← links)
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems (Q897051) (← links)
- Sparse quasi-Newton updates with positive definite matrix completion (Q930341) (← links)
- Augmented Lagrangian applied to convex quadratic problems (Q932544) (← links)
- Modification of the Wolfe line search rules to satisfy the descent condition in the Polak-Ribière-Polyak conjugate gradient method (Q933809) (← links)
- A derivative-free algorithm for systems of nonlinear inequalities (Q941047) (← links)
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization (Q946337) (← links)
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts (Q953208) (← links)
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q955062) (← links)
