The following pages link to MINPACK-2 (Q16919):
Displaying 50 items.
- On three-term conjugate gradient algorithms for unconstrained optimization (Q120733) (← links)
- A simple three-term conjugate gradient algorithm for unconstrained optimization (Q120734) (← links)
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization (Q382920) (← links)
- Adapting derivative free optimization methods to engineering models with discrete variables (Q400044) (← links)
- Adaptive sequencing of primal, dual, and design steps in simulation based optimization (Q404526) (← links)
- An adaptive conjugate gradient algorithm for large-scale unconstrained optimization (Q495053) (← links)
- Stopping rules and backward error analysis for bound-constrained optimization (Q639367) (← links)
- Comparative assessment of algorithms and software for global optimization (Q813366) (← links)
- Optimality-preserving elimination of linearities in Jacobian accumulation (Q871161) (← links)
- A globally convergent inexact Newton method with a new choice for the forcing term (Q940862) (← links)
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization (Q970585) (← links)
- Tensor methods for large sparse systems of nonlinear equations (Q1290627) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (Q1657404) (← links)
- A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization (Q1915809) (← links)
- Nonlinear optimization applications using the GAMS technology (Q1946762) (← links)
- Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
- Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations (Q2067307) (← links)
- A reduced proximal-point homotopy method for large-scale non-convex BQP (Q2114822) (← links)
- Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization (Q2125037) (← links)
- A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization (Q2129634) (← links)
- Compact sparse symbolic Jacobian computation in large systems of ODEs (Q2242825) (← links)
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update (Q2359995) (← links)
- PAL-Hom method for QP and an application to LP (Q2419548) (← links)
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization (Q2501110) (← links)
- A family of stochastic programming test problems based on a model for tactical manpower planning (Q2583506) (← links)
- (Q2724090) (← links)
- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization (Q2867433) (← links)
- Implementation of Partial Separability in a Source-to-Source Transformation AD Tool (Q2913152) (← links)
- A New Adaptive Conjugate Gradient Algorithm for Large-Scale Unconstrained Optimization (Q2957702) (← links)
- Recent Advances in Bound Constrained Optimization (Q3004453) (← links)
- Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization (Q3096872) (← links)
- Hierarchical approaches to automatic differentiation (Q3125539) (← links)
- (Q3125550) (← links)
- ADiJaC -- Automatic Differentiation of Java Classfiles (Q3176305) (← links)
- Flexible complementarity solvers for large-scale applications (Q3377979) (← links)
- A New Active Set Algorithm for Box Constrained Optimization (Q3440221) (← links)
- (Q3528770) (← links)
- (Q4226955) (← links)
- Computing Large Sparse Jacobian Matrices Using Automatic Differentiation (Q4294364) (← links)
- Evaluation of Large-scale Optimization Problems on Vector and Parallel Architectures (Q4321306) (← links)
- Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation (Q4354079) (← links)
- Computing Gradients in Large-Scale Optimization Using Automatic Differentiation (Q4354939) (← links)
- Efficient Derivative Codes through Automatic Differentiation and Interface Contraction: An Application in Biostatistics (Q4376221) (← links)
- Inexact Block Jacobi--Broyden Methods for Solving Nonlinear Systems of Equations (Q4376241) (← links)
- The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation (Q4389291) (← links)
- Tensor Methods for Large, Sparse Nonlinear Least Squares Problems (Q4509768) (← links)
- A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization (Q4559412) (← links)
- Algorithm 984 (Q4581382) (← links)
