Testing Unconstrained Optimization Software
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A nonmonotone conic trust region method based on line search for solving unconstrained optimization
- A note on the Levenberg-Marquardt parameter
- Recognizing underlying sparsity in optimization
- Combining trust-region techniques and Rosenbrock methods to compute stationary points
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- A modified PRP conjugate gradient method
- A new trust region method with adaptive radius
- Low order-value optimization and applications
- A conic trust-region method and its convergence properties
- A new backtracking inexact BFGS method for symmetric nonlinear equations
- A hybrid of the Newton-GMRES and electromagnetic meta-heuristic methods for solving systems of nonlinear equations
- A descent algorithm without line search for unconstrained optimization
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search
- On the convergence of a process basing on the modified secant method
- Solution of nonlinear systems of equations by an optimal projection method
- Solving systems of nonlinear equations by means of an accelerated successive orthogonal projections method
- A parallel subgradient projections method for the convex feasibility problem
- A new quasi-Newton algorithm
- A truncated Newton method with non-monotone line search for unconstrained optimization
- On the construction of minimization methods of quasi-Newton type
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Parallel quasi-Newton methods for unconstrained optimization
- Successive column correction algorithms for solving sparse nonlinear systems of equations
- Nonlinear reduction for solving deficient polynomial systems by continuation methods
- A rational gradient model for minimization
- A quasi-Gauss-Newton method for solving nonlinear algebraic equations
- A quasi-Newton method for solving nonlinear algebraic equations
- Symbolic homotopy construction
- On the use of function-values in unconstrained optimisation
- Numerical expirience with a class of self-scaling quasi-Newton algorithms
- Modified partial-update Newton-type algorithms for unary optimization
- A generalized conjugate gradient algorithm
- A gentle introduction to Numerica
- Tensor methods for large sparse systems of nonlinear equations
- A model-trust region algorithm utilizing a quadratic interpolant
- Scaled optimal path trust-region algorithm
- Generalized Polak-Ribière algorithm
- Variational quasi-Newton methods for unconstrained optimization
- A parallel asynchronous Newton algorithm for unconstrained optimization
- Successive element correction algorithms for sparse unconstrained optimization
- Sizing the BFGS and DFP updates: Numerical study
- Preconditioned low-order Newton methods
- Inexact trust region method for large sparse systems of nonlinear equations
- Multi-step quasi-Newton methods for optimization
- Computational experience with known variable metric updates
- A class of nonmonotone stabilization trust region methods
- The least prior deviation quasi-Newton update
- Family of optimally conditioned quasi-Newton updates for unconstrained optimization
- A quasi-Newton method using a nonquadratic model
- Quasi-Newton method by Hermite interpolation
- Interpolation by conic model for unconstrained optimization
- The convergence speed of interval methods for global optimization
- Modifying the BFGS method
- Nonmonotone Levenberg-Marquardt algorithms and their convergence analysis
- Alternating multi-step quasi-Newton methods for unconstrained optimization
- Quasi-Newton methods with derivatives
- Parallel algorithm for unconstrained optimization based on decomposition techniques
- \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}
- Performance of several nonlinear programming software packages on microcomputers.
- Inverse \(q\)-columns updating methods for solving nonlinear systems of equations
- Experiments with new stochastic global optimization search techniques
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization
- A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization
- A new adaptive trust-region method for system of nonlinear equations
- A new adaptive trust region algorithm for optimization problems
- Best practices for comparing optimization algorithms
- A corrected Levenberg-Marquardt algorithm with a nonmonotone line search for the system of nonlinear equations
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization
- On the efficiency of gradient based optimization algorithms for DNS-based optimal control in a turbulent channel flow
- A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
- An inexact Newton-like conditional gradient method for constrained nonlinear systems
- On the convergence of \(s\)-dependent GFR conjugate gradient method for unconstrained optimization
- A globally convergent method for nonlinear least-squares problems based on the Gauss-Newton model with spectral correction
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
- A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems
- A class of one parameter conjugate gradient methods
- A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem
- On the construction of quadratic models for derivative-free trust-region algorithms
- Adaptive stochastic approximation algorithm
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- On the worst-case evaluation complexity of non-monotone line search algorithms
- A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares
- Improved optimization methods for image registration problems
- Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization
- A simple alternating direction method for the conic trust region subproblem
- Global convergence of Schubert's method for solving sparse nonlinear equations
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- A nonmonotone weighting self-adaptive trust region algorithm for unconstrained nonconvex optimization
- A hybrid of DL and WYL nonlinear conjugate gradient methods
- The hybrid BFGS-CG method in solving unconstrained optimization problems
- A limited memory BFGS method for solving large-scale symmetric nonlinear equations
- A fractional trust region method for linear equality constrained optimization
- A high-order modified Levenberg-Marquardt method for systems of nonlinear equations with fourth-order convergence
This page was built for publication: Testing Unconstrained Optimization Software
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902415)
