The following pages link to CUTEr (Q16200):
Displaying 50 items.
- Second-order negative-curvature methods for box-constrained and general constrained optimization (Q2379692) (← links)
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization (Q2390003) (← links)
- Global convergence and the Powell singular function (Q2392109) (← links)
- A penalty-interior-point algorithm for nonlinear constrained optimization (Q2392661) (← links)
- Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
- \(n\)-step quadratic convergence of a restart Liu-Storey type method (Q2392968) (← links)
- Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
- On efficiently combining limited-memory and trust-region techniques (Q2398109) (← links)
- A frame-based conjugate gradients direct search method with radial basis function interpolation model (Q2398571) (← links)
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method (Q2400710) (← links)
- A modified nonmonotone BFGS algorithm for unconstrained optimization (Q2400759) (← links)
- A comparison of reduced and unreduced KKT systems arising from interior point methods (Q2401021) (← links)
- Global convergence of a modified conjugate gradient method (Q2405656) (← links)
- PAL-Hom method for QP and an application to LP (Q2419548) (← links)
- Spectral analysis of the preconditioned system for the \(3 \times 3\) block saddle point problem (Q2420149) (← links)
- An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities (Q2420776) (← links)
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← links)
- Gradient method with multiple damping for large-scale unconstrained optimization (Q2421450) (← links)
- A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions (Q2424224) (← links)
- How good are projection methods for convex feasibility problems? (Q2427393) (← links)
- Local analysis of the feasible primal-dual interior-point method (Q2427394) (← links)
- A new method of moving asymptotes for large-scale linearly equality-constrained minimization (Q2431059) (← links)
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search (Q2433993) (← links)
- A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization (Q2436686) (← links)
- A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization (Q2441364) (← links)
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization (Q2448155) (← links)
- A conjugate directions approach to improve the limited-memory BFGS method (Q2449186) (← links)
- A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties (Q2453184) (← links)
- Global convergence of a general filter algorithm based on an efficiency condition of the step (Q2453360) (← links)
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
- Iterative computation of negative curvature directions in large scale optimization (Q2457949) (← links)
- Improving solver success in reaching feasibility for sets of nonlinear constraints (Q2459379) (← links)
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification (Q2467167) (← links)
- A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization (Q2469707) (← links)
- On the method of shortest residuals for unconstrained optimization (Q2471088) (← links)
- Nonmonotone projected gradient methods based on barrier and Euclidean distances (Q2477010) (← links)
- Scaled conjugate gradient algorithms for unconstrained optimization (Q2477015) (← links)
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization (Q2479826) (← links)
- Self-adaptive inexact proximal point methods (Q2479838) (← links)
- A trust region method for optimization problem with singular solutions (Q2480784) (← links)
- Another hybrid conjugate gradient algorithm for unconstrained optimization (Q2481406) (← links)
- Nonconvex optimization using negative curvature within a modified linesearch (Q2482748) (← links)
- Two descent hybrid conjugate gradient methods for optimization (Q2483351) (← links)
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming (Q2490321) (← links)
- An interior algorithm for nonlinear optimization that combines line search and trust region steps (Q2492700) (← links)
- Convergence of nonmonotone line search method (Q2493941) (← links)
- Mathematical programming models and algorithms for engineering design optimization (Q2495616) (← links)
- Optimization theory and methods. Nonlinear programming (Q2500511) (← links)
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion (Q2502232) (← links)
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization (Q2503148) (← links)
