The following pages link to CUTE (Q4371578):
Displayed 50 items.
- CUTE (Q26578) (← 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 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 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)
- A framework for globally convergent algorithms using gradient bounding functions (Q1289400) (← links)
- Corrected sequential linear programming for sparse minimax optimization (Q1338528) (← links)
- Recent progress in unconstrained nonlinear optimization without derivatives (Q1365064) (← links)
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming (Q1433470) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- A starting point strategy for nonlinear interior methods. (Q1767154) (← links)
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization (Q1769069) (← links)
- Nonmonotone strategy for minimization of quadratics with simple constraints. (Q1771833) (← links)
- Nonmonotone curvilinear line search methods for unconstrained optimization (Q1816399) (← links)
- A numerical study of limited memory BFGS methods (Q1861792) (← links)
- Inertia-controlling factorizations for optimization algorithms (Q1862009) (← links)
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization (Q1915809) (← links)
- Computational experience with penalty-barrier methods for nonlinear programming (Q1915922) (← links)
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search (Q2433993) (← 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)
- 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)
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update (Q2490335) (← 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)