The following pages link to CUTEr (Q16200):
Displaying 50 items.
- An improved nonlinear conjugate gradient method with an optimal property (Q476750) (← links)
- A variance-based method to rank input variables of the mesh adaptive direct search algorithm (Q479211) (← links)
- Two modified three-term conjugate gradient methods with sufficient descent property (Q479259) (← links)
- Study of a primal-dual algorithm for equality constrained minimization (Q480924) (← links)
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization (Q480926) (← links)
- qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
- An affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming (Q488945) (← links)
- Analysis of sparse quasi-Newton updates with positive definite matrix completion (Q489095) (← links)
- An adaptive augmented Lagrangian method for large-scale constrained optimization (Q494324) (← links)
- Globally convergent evolution strategies (Q494335) (← links)
- Optimization of algorithms with OPAL (Q495935) (← links)
- A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems (Q499683) (← links)
- A limited memory descent Perry conjugate gradient method (Q518141) (← links)
- On optimality of two adaptive choices for the parameter of Dai-Liao method (Q518148) (← links)
- Dai-Kou type conjugate gradient methods with a line search only using gradient (Q522525) (← links)
- Global optimization test problems based on random field composition (Q523165) (← links)
- A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update (Q523565) (← links)
- Structured regularization for barrier NLP solvers (Q523568) (← links)
- A modified three-term PRP conjugate gradient algorithm for optimization models (Q527794) (← links)
- A modified three-term conjugate gradient method with sufficient descent property (Q530722) (← links)
- An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments (Q531641) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013) (← 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)
- Inverse problems and solution methods for a class of nonlinear complementarity problems (Q540647) (← links)
- An interior-point piecewise linear penalty method for nonlinear programming (Q543401) (← links)
- Combining and scaling descent and negative curvature directions (Q543412) (← links)
- Active-set strategy in Powell's method for optimization without derivatives (Q545940) (← links)
- A derivative-free trust-region algorithm for unconstrained optimization with controlled error (Q550515) (← links)
- A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization (Q555476) (← links)
- CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm (Q557727) (← 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 non-monotone line search algorithm for unconstrained optimization (Q618548) (← 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)
- A projected-gradient interior-point algorithm for complementarity problems (Q634730) (← links)
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization (Q635233) (← links)
- Outer trust-region method for constrained optimization (Q637557) (← links)
- Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← links)
- Global convergence of some modified PRP nonlinear conjugate gradient methods (Q644512) (← links)
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates (Q645035) (← 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)
