minpack

swMATH5310MaRDI QIDQ17450FDOQ17450

Author name not available (Why is that?)

Described by source

• Unnamed Publication
• Testing Unconstrained Optimization Software

Cited In (only showing first 100 items - show all)

• A new cubic convergent method for solving a system of nonlinear equations
• Direct Secant Updates of Matrix Factorizations
• An improved interval global optimization algorithm using higher-order inclusion function forms
• On the convergence of a process basing on the modified secant method
• A modified nonlinear conjugate gradient method with the Armijo line search and its application
• Parameter identification by continuation methods
• Modifying the BFGS method
• A non-monotone pattern search approach for systems of nonlinear equations
• On the use of simplex methods in constructing quadratic models
• A trust-region method with a conic model for unconstrained optimization
• A multi-iterate method to solve systems of nonlinear equations
• The method of successive orthogonal projections for solving nonlinear simultaneous equations
• Title not available (Why is that?)
• Complex-step derivative approximation in noisy environment
• Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method
• A geometric inverse problem identification procedure for detection of cavities
• A trust-region-based BFGS method with line search technique for symmetric nonlinear equations
• Parallel quasi-Newton methods for unconstrained optimization
• Magnetohydrodynamic flow between a solid rotating disk and a porous stationary disk
• Analysis of a self-scaling quasi-Newton method
• Implicit updates in multistep quasi-Newton methods
• A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization
• A memetic algorithm for the flexible flow line scheduling problem with processor blocking
• Finding zeros by multilevel subdivision techniques
• Nonmonotone Levenberg-Marquardt algorithms and their convergence analysis
• Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems
• A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization
• Development of a model for the Description of Intra-diffusion in Homogeneous Liquid Lennard–Jones Mixtures
• Computational experience with bank-one positive definite quasi-newton algorithms
• Inverse \(q\)-columns updating methods for solving nonlinear systems of equations
• Convergence of the Polak-Ribiére-Polyak conjugate gradient method
• The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems
• Combining nonmonotone conic trust region and line search techniques for unconstrained optimization
• Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
• Scaled optimal path trust-region algorithm
• A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization
• The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• On an iterative algorithm of order 1.839\(\dots\) for solving the nonlinear least squares problems
• A grid algorithm for bound constrained optimization of noisy functions
• Geometric optimal control and applications to aerospace
• A derivative free iterative method for solving least squares problems
• Constructing composite search directions with parameters in quadratic interpolation models
• Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
• A quantitative metric for robustness of nonlinear algebraic equation solvers
• From linear to nonlinear iterative methods
• Successive column correction algorithms for solving sparse nonlinear systems of equations
• Self-adaptive randomized and rank-based differential evolution for multimodal problems
• A quasi-discrete Newton algorithm with a nonmonotone stabilization technique
• An algorithm for solving sparse nonlinear least squares problems
• Superlinearly convergent trust-region method without the assumption of positive-definite Hessian
• Convexity and concavity detection in computational graphs: tree walks for convexity assessment
• Cross-Hill: a heuristic method for global optimization
• On locating the zeros and poles of a meromorphic function
• A parallel implementation of automatic differentiation for partially separable functions using PVM
• A new linesearch algorithm for nonlinear least squares problems
• Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems
• Low order-value optimization and applications
• Dealing with singularities in nonlinear unconstrained optimization
• Numerical research on the sensitivity of nonmonotone trust region algorithms to their parameters
• Convergence analysis of a block improvement method for polynomial optimization over unit spheres
• A rank-one fitting method for solving symmetric nonlinear equations
• An anticipative feedback solution for the infinite-horizon, linear-quadratic, dynamic, Stackelberg game.
• \textsc{Gibbs2}: A new version of the quasi-harmonic model code. I. Robust treatment of the static data
• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
• A trust-region method with improved adaptive radius for systems of nonlinear equations
• An efficient nonmonotone trust-region method for unconstrained optimization
• A BFGS trust-region method for nonlinear equations
• Limited memory BFGS method with backtracking for symmetric nonlinear equations
• Title not available (Why is that?)
• A Subspace Study on Conjugate Gradient Algorithms
• Modifications of Newton's method to extend the convergence domain
• A conjugate gradient method with descent direction for unconstrained optimization
• Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization
• A nonmonotone trust region method based on simple conic models for unconstrained optimization
• On restart procedures for the conjugate gradient method
• The convergence of conjugate gradient method with nonmonotone line search
• A nonmonotone trust region method with adaptive radius for unconstrained optimization problems
• An improved trust region algorithm for nonlinear equations
• A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
• A shooting algorithm for optimal control problems with singular Arcs
• A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems
• A trust-region approach with novel filter adaptive radius for system of nonlinear equations
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• A modified PRP conjugate gradient method
• A new backtracking inexact BFGS method for symmetric nonlinear equations
• A hybrid trust region algorithm for unconstrained optimization
• Convergence rate of the trust region method for nonlinear equations under local error bound condition
• A nonmonotone adaptive trust region method for unconstrained optimization based on conic model
• Nonmonotone trust region algorithm for unconstrained optimization problems
• Direct analytical solution of a modified form of the meshing equations in two dimensions for non-conjugate gear contact
• Recognizing underlying sparsity in optimization
• CARTopt: a random search method for nonsmooth unconstrained optimization
• Scaled memoryless symmetric rank one method for large-scale optimization
• Optimal positioning of anodes and virtual sources in the design of cathodic protection systems using the method of fundamental solutions
• Tensor methods for large sparse systems of nonlinear equations
• Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
• A class of nonmonotone stabilization trust region methods
• A nonmonotone trust region method for unconstrained optimization

This page was built for software: minpack