Testing Unconstrained Optimization Software
From MaRDI portal
Publication:3902415
DOI10.1145/355934.355936zbMath0454.65049OpenAlexW2056603712MaRDI QIDQ3902415
Jorge J. Moré, Kenneth E. Hillstrom, B. S. Garbow
Publication date: 1981
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355934.355936
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)
Related Items (only showing first 100 items - show all)
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 ⋮ A new direct search method based on separable fractional interpolation model ⋮ A class of parameter-free filled functions for box-constrained system of nonlinear equations ⋮ Douglas-Rachford splitting method for semidefinite programming ⋮ An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization ⋮ A direct search method for unconstrained quantile-based simulation optimization ⋮ Global optimization using \(q\)-gradients ⋮ A new family of globally convergent conjugate gradient methods ⋮ Test problem generator for unconstrained global optimization ⋮ Approximate Gauss-Newton methods for solving underdetermined nonlinear least squares problems ⋮ Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction ⋮ A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems ⋮ On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems ⋮ Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization ⋮ A Shamanskii-like Levenberg-Marquardt method for nonlinear equations ⋮ Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method ⋮ Parallel Uzawa method for large-scale minimization of partially separable functions ⋮ A nonmonotone trust region method with new inexact line search for unconstrained optimization ⋮ Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization ⋮ Nonlinear conjugate gradient methods with Wolfe type line search ⋮ A new two-step gradient-type method for large-scale unconstrained optimization ⋮ CARTopt: a random search method for nonsmooth unconstrained optimization ⋮ Multiagent cooperation for solving global optimization problems: an extendible framework with example cooperation strategies ⋮ A trust-region-based BFGS method with line search technique for symmetric nonlinear equations ⋮ The convergence of conjugate gradient method with nonmonotone line search ⋮ New cautious BFGS algorithm based on modified Armijo-type line search ⋮ A nonmonotone trust region method with adaptive radius for unconstrained optimization problems ⋮ Nonsmooth exclusion test for finding all solutions of nonlinear equations ⋮ Local convergence of a secant type method for solving least squares problems ⋮ A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization ⋮ A nonmonotone adaptive trust region method for unconstrained optimization based on conic model ⋮ Nonmonotone trust region algorithm for unconstrained optimization problems ⋮ A model-hybrid approach for unconstrained optimization problems ⋮ On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians ⋮ Nonmonotone adaptive trust region method ⋮ Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems ⋮ Global convergence of a nonlinear conjugate gradient method ⋮ Global convergence of a modified spectral conjugate gradient method ⋮ An efficient descent direction method with cutting planes ⋮ An efficient nonmonotone trust-region method for unconstrained optimization ⋮ An improved trust region algorithm for nonlinear equations ⋮ A variant spectral-type FR conjugate gradient method and its global convergence ⋮ A hybrid shuffled complex evolution approach based on differential evolution for unconstrained optimization ⋮ Combining nonmonotone conic trust region and line search techniques for unconstrained optimization ⋮ A restarting approach for the symmetric rank one update for unconstrained optimization ⋮ Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions ⋮ A secant method for nonlinear least-squares minimization ⋮ Implementing the Nelder-Mead simplex algorithm with adaptive parameters ⋮ Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization ⋮ A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems ⋮ An improved multi-step gradient-type method for large scale optimization ⋮ A mixed spectral CD-DY conjugate gradient method ⋮ A BFGS trust-region method for nonlinear equations ⋮ Limited memory BFGS method with backtracking for symmetric nonlinear equations ⋮ A combined class of self-scaling and modified quasi-Newton methods ⋮ A symmetric rank-one method based on extra updating techniques for unconstrained optimization ⋮ A derivative free iterative method for solving least squares problems ⋮ Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions ⋮ Constructing composite search directions with parameters in quadratic interpolation models ⋮ A higher-order Levenberg-Marquardt method for nonlinear equations ⋮ Self-adaptive randomized and rank-based differential evolution for multimodal problems ⋮ Analysis of sparse quasi-Newton updates with positive definite matrix completion ⋮ Modifications of Newton's method to extend the convergence domain ⋮ Cross-Hill: a heuristic method for global optimization ⋮ A quasi-Newton trust region method based on a new fractional model ⋮ Continuous global optimization through the generation of parametric curves ⋮ A nonmonotone line search method for noisy minimization ⋮ A trust-region approach with novel filter adaptive radius for system of nonlinear equations ⋮ A class of diagonal quasi-Newton methods for large-scale convex minimization ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization ⋮ A quasi-Newton algorithm for large-scale nonlinear equations ⋮ A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound ⋮ On the multi-point Levenberg-Marquardt method for singular nonlinear equations ⋮ A new trust-region method for solving systems of equalities and inequalities ⋮ Analysis of a self-scaling quasi-Newton method ⋮ A hybrid trust region algorithm for unconstrained optimization ⋮ A hybrid ODE-based method for unconstrained optimization problems ⋮ A first-order interior-point method for linearly constrained smooth optimization ⋮ Modified nonmonotone Armijo line search for descent method ⋮ Global convergence of a two-parameter family of conjugate gradient methods without line search ⋮ The extrapolated interval global optimization algorithm ⋮ A convergent variant of the Nelder--Mead algorithm ⋮ An accurate active set Newton algorithm for large scale bound constrained optimization. ⋮ A critical review of discrete filled function methods in solving nonlinear discrete optimization problems ⋮ A modified Brown algorithm for solving singular nonlinear systems with rank defects ⋮ CANM, a program for numerical solution of a system of nonlinear equations using the continuous analog of Newton's method ⋮ A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization ⋮ Convergence analysis of a modified BFGS method on convex minimizations ⋮ The method of successive orthogonal projections for solving nonlinear simultaneous equations ⋮ Scaled memoryless symmetric rank one method for large-scale optimization ⋮ A conjugate gradient method with descent direction for unconstrained optimization ⋮ minpack ⋮ A restricted trust region algorithm for unconstrained optimization ⋮ A new type of quasi-Newton updating formulas based on the new quasi-Newton equation ⋮ Benchmarking results for the Newton-Anderson method ⋮ A quasi-Newton method with modification of one column per iteration ⋮ A parallel unconstrained quasi-Newton algorithm and its performance on a local memory parallel computer ⋮ 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
Uses Software
This page was built for publication: Testing Unconstrained Optimization Software
