User Guide for Minpack-1

By Jorge J. Moré, B. S. Garbow, K. E. Hillstrom. 1980

Subfields: Mathematical Optimization, Numerical Methods & Scientific Computing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Mathematical Optimization

In Numerical Methods & Scientific Computing

Citations in the corpus

Low-storage, Explicit Runge-Kutta Schemes for the Compressible Navier-Stokes Equations (2000, methodology): “Most solutions that are presented within this paper have been found numerically with established mathematical software [19, 29, 30, 60, 90].”
The first data release (DR1) of the LAMOST regular survey (2015, methodology): “The parameters of the TGM are evaluated together with those of the line-of-sight velocity distribution (LOSVD) using a Levenberg-Marquardt (Marquardt 1963; Moré et al. 1980) routine (hereafter LM).”
Practical Techniques for Low-Thrust Trajectory Optimization with Homotopic Approach (2012, methodology): “To solve the shooting function of TPBVP, MinPack-1 [30], a package of FORTRAN subprograms for the numerical solution of systems of nonlinear equations and nonlinear least-squares problems, is used.”
Asymptotically exact inference in differentiable generative models (2016, methodology): “In the implementation used in the experiments, we fall back to a minpack [63] implementation of Powell’s Hybrid method [76] if the quasi-Newton iteration fails to converge, with”
Efficient multi-Gaussian expansion of galaxies (2002, methodology): “This idea was generalized to the non-spherical case and made applicable to real galaxies by Monnet, Bacon & Emsellem (1 992) and further developed by Emsellem, Monnet & Bacon (1994a) and Emsellem, Dejonge & Bacon (1999).”
Improving the full spectrum fitting method: accurate convolution with Gauss-Hermite functions (2016, methodology): “This makes the method much more robust and efficient than generic optimizers of scalar functions. ppxf uses the state-of-the-art minpack implementation of the Levenberg-Marquardt method by Moré et al. (1980), which is based on the robust trust region method.”
Best practices for differentiated products demand estimation with PyBLP (2020, methodology): “root, which calls the LM routine from MINPACK (More et al., 1980).”
VALIDATION OF KEPLER'S MULTIPLE PLANET CANDIDATES. III. LIGHT CURVE ANALYSIS AND ANNOUNCEMENT OF HUNDREDS OF NEW MULTI-PLANET SYSTEMS (2014, background): “Some of these systems have also been confirmed from radial velocity (RV) detection (Marcy et al. 2013; Gautier et al. 2012), transit timing variations (Ford et al. 2011; Steffen et al. 2012), and planet validation techniques such as BLENDER (Torres et al. 2011; Fressin et al. 2012) and now through…”
Inverse statistical problems: from the inverse Ising problem to data science (2017, methodology): “The numerical maximisation of the likelihood and pseudolikelihood was done using the Eigen 3 wrappers [89] for Minpack [155].”
A Fast Apparent‐Horizon Finder for 3‐Dimensional Cartesian Grids in Numerical Relativity (2003, methodology): “6 Additionally, due to the way AHFINDERDIRECT finds multiple AHs in parallel across multiple processors (discussed in detail in appendix B), it would be difficult to use many of the uniprocessor modified-Newton software packages such as [ 36 , 38, 39].”
Locally Weighted Learning (1997, unknown): “0 2 d --> 0 0.2 0.4 0.6 0.8 1 (1 - d^2)^2 0 2 d --> 0 0.2 0.4 0.6 0.8 1 1/(d+1) 0 2 d --> 0 0.2 0.4 0.6 0.8 1 Uniform 0 2 d --> 0 0.2 0.4 0.6 0.8 1 (1 - d^3)^3 Figure Some of the ker nel shapes described in the text data Weight functions that go to zero at a nite distance allow faster implementation”
Kinemetry: a generalization of photometry to the higher moments of the line-of-sight velocity distribution (2005, methodology): “We use the MINPACK implementation (Moré et al. 1980) of the LevenbergMarquardt method3.”