Pages that link to "Item:Q3902415"
From MaRDI portal
The following pages link to Testing Unconstrained Optimization Software (Q3902415):
Displaying 50 items.
- minpack (Q17450) (← links)
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
- A trust-region method with improved adaptive radius for systems of nonlinear equations (Q261542) (← links)
- Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization (Q272601) (← links)
- A nonmonotone trust region method based on simple conic models for unconstrained optimization (Q275735) (← links)
- A new direct search method based on separable fractional interpolation model (Q287849) (← links)
- A class of parameter-free filled functions for box-constrained system of nonlinear equations (Q287871) (← links)
- Douglas-Rachford splitting method for semidefinite programming (Q295495) (← links)
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization (Q315505) (← links)
- A direct search method for unconstrained quantile-based simulation optimization (Q319799) (← links)
- Global optimization using \(q\)-gradients (Q322763) (← links)
- A new family of globally convergent conjugate gradient methods (Q333105) (← links)
- Test problem generator for unconstrained global optimization (Q337165) (← links)
- Approximate Gauss-Newton methods for solving underdetermined nonlinear least squares problems (Q338527) (← links)
- Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction (Q342078) (← links)
- A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems (Q354989) (← links)
- On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems (Q356122) (← links)
- Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization (Q357379) (← links)
- A Shamanskii-like Levenberg-Marquardt method for nonlinear equations (Q360386) (← links)
- Parallel Uzawa method for large-scale minimization of partially separable functions (Q368609) (← links)
- A nonmonotone trust region method with new inexact line search for unconstrained optimization (Q369443) (← links)
- Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization (Q370023) (← links)
- Nonlinear conjugate gradient methods with Wolfe type line search (Q370171) (← links)
- CARTopt: a random search method for nonsmooth unconstrained optimization (Q377726) (← links)
- Multiagent cooperation for solving global optimization problems: an extendible framework with example cooperation strategies (Q377733) (← links)
- New cautious BFGS algorithm based on modified Armijo-type line search (Q385833) (← links)
- A model-hybrid approach for unconstrained optimization problems (Q403087) (← links)
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
- Global convergence of a nonlinear conjugate gradient method (Q410397) (← links)
- Global convergence of a modified spectral conjugate gradient method (Q411054) (← links)
- An efficient nonmonotone trust-region method for unconstrained optimization (Q411524) (← links)
- Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions (Q433026) (← links)
- A secant method for nonlinear least-squares minimization (Q434156) (← links)
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters (Q434176) (← links)
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization (Q438775) (← links)
- A mixed spectral CD-DY conjugate gradient method (Q442966) (← links)
- A combined class of self-scaling and modified quasi-Newton methods (Q453615) (← links)
- A higher-order Levenberg-Marquardt method for nonlinear equations (Q470916) (← links)
- Analysis of sparse quasi-Newton updates with positive definite matrix completion (Q489095) (← links)
- Modifications of Newton's method to extend the convergence domain (Q489978) (← links)
- A quasi-Newton trust region method based on a new fractional model (Q494269) (← links)
- A nonmonotone line search method for noisy minimization (Q499697) (← links)
- A trust-region approach with novel filter adaptive radius for system of nonlinear equations (Q501965) (← links)
- A class of diagonal quasi-Newton methods for large-scale convex minimization (Q503542) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- 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)
