The following pages link to minpack (Q17450):
Displaying 50 items.
- A quasi-Newton algorithm for large-scale nonlinear equations (Q509967) (← links)
- A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound (Q520265) (← links)
- On the multi-point Levenberg-Marquardt method for singular nonlinear equations (Q520266) (← links)
- A new trust-region method for solving systems of equalities and inequalities (Q520331) (← links)
- A hybrid trust region algorithm for unconstrained optimization (Q534267) (← links)
- A first-order interior-point method for linearly constrained smooth optimization (Q535018) (← links)
- Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
- QRAP: a numerical code for projected (Q)uasiparticle (RA)ndom (P)hase approximation (Q536929) (← links)
- Step-size estimation for unconstrained optimization methods (Q539765) (← links)
- The extrapolated interval global optimization algorithm (Q540704) (← links)
- Fast unconditionally stable 2-D analysis of non-conjugate gear contacts using an explicit formulation of the meshing equations (Q553631) (← links)
- A modified Brown algorithm for solving singular nonlinear systems with rank defects (Q557689) (← links)
- The method of successive orthogonal projections for solving nonlinear simultaneous equations (Q579851) (← links)
- Globally convergent homotopy methods: A tutorial (Q582009) (← links)
- On restart procedures for the conjugate gradient method (Q596670) (← links)
- Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method (Q597160) (← links)
- A new two-step gradient-type method for large-scale unconstrained optimization (Q604019) (← links)
- A trust-region-based BFGS method with line search technique for symmetric nonlinear equations (Q606189) (← links)
- The convergence of conjugate gradient method with nonmonotone line search (Q606706) (← links)
- A nonmonotone trust region method with adaptive radius for unconstrained optimization problems (Q611316) (← links)
- Nonsmooth exclusion test for finding all solutions of nonlinear equations (Q616162) (← links)
- Local convergence of a secant type method for solving least squares problems (Q618062) (← links)
- A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization (Q618130) (← links)
- A nonmonotone adaptive trust region method for unconstrained optimization based on conic model (Q618131) (← links)
- Nonmonotone trust region algorithm for unconstrained optimization problems (Q618133) (← links)
- Nonmonotone adaptive trust region method (Q621656) (← links)
- Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems (Q623198) (← links)
- An efficient descent direction method with cutting planes (Q623787) (← links)
- The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems (Q625664) (← links)
- An improved trust region algorithm for nonlinear equations (Q626644) (← links)
- A variant spectral-type FR conjugate gradient method and its global convergence (Q628913) (← links)
- A hybrid shuffled complex evolution approach based on differential evolution for unconstrained optimization (Q628958) (← links)
- Combining nonmonotone conic trust region and line search techniques for unconstrained optimization (Q629507) (← links)
- A restarting approach for the symmetric rank one update for unconstrained optimization (Q632383) (← links)
- A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems (Q639203) (← links)
- An improved multi-step gradient-type method for large scale optimization (Q640533) (← links)
- A BFGS trust-region method for nonlinear equations (Q644875) (← links)
- Limited memory BFGS method with backtracking for symmetric nonlinear equations (Q646097) (← links)
- Stochastic elastic-plastic finite elements (Q646317) (← links)
- A symmetric rank-one method based on extra updating techniques for unconstrained optimization (Q651495) (← links)
- A derivative free iterative method for solving least squares problems (Q652325) (← links)
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions (Q652326) (← links)
- Constructing composite search directions with parameters in quadratic interpolation models (Q652677) (← links)
- A quantitative metric for robustness of nonlinear algebraic equation solvers (Q654362) (← links)
- Self-adaptive randomized and rank-based differential evolution for multimodal problems (Q656961) (← links)
- Cross-Hill: a heuristic method for global optimization (Q669439) (← links)
- Continuous global optimization through the generation of parametric curves (Q671196) (← links)
- A parallel implementation of automatic differentiation for partially separable functions using PVM (Q671296) (← links)
- Analysis of a self-scaling quasi-Newton method (Q689143) (← links)
- A hybrid ODE-based method for unconstrained optimization problems (Q694546) (← links)