Pages that link to "Item:Q2352415"
From MaRDI portal
The following pages link to CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (Q2352415):
Displaying 50 items.
- A regularization method for constrained nonlinear least squares (Q2191800) (← links)
- Iterative grossone-based computation of negative curvature directions in large-scale optimization (Q2194128) (← links)
- Two-step conjugate gradient method for unconstrained optimization (Q2204167) (← links)
- An augmented Lagrangian filter method (Q2216190) (← links)
- Scaled projected-directions methods with application to transmission tomography (Q2218907) (← links)
- An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem (Q2275169) (← links)
- On efficiency of nonmonotone Armijo-type line searches (Q2284837) (← links)
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds (Q2288191) (← links)
- A derivative-free Gauss-Newton method (Q2295977) (← links)
- An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation (Q2297152) (← links)
- A new conjugate gradient method with an efficient memory structure (Q2322448) (← links)
- A subspace SQP method for equality constrained optimization (Q2322557) (← links)
- An improved hybrid-ORBIT algorithm based on point sorting and MLE technique (Q2326918) (← links)
- On global minimizers of quadratic functions with cubic regularization (Q2329649) (← links)
- Linear equalities in blackbox optimization (Q2340487) (← links)
- Methods for convex and general quadratic programming (Q2356335) (← links)
- Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization (Q2358022) (← links)
- A two-stage active-set algorithm for bound-constrained optimization (Q2359771) (← links)
- Sequential equality-constrained optimization for nonlinear programming (Q2374366) (← links)
- Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method (Q2374367) (← links)
- On the update of constraint preconditioners for regularized KKT systems (Q2397820) (← links)
- A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization (Q2397822) (← links)
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500) (← links)
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization (Q2417038) (← links)
- A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques (Q2419518) (← links)
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520) (← links)
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (Q2419564) (← links)
- Preconditioned nonlinear conjugate gradient methods based on a modified secant equation (Q2422866) (← links)
- Exploiting negative curvature in deterministic and stochastic optimization (Q2425164) (← links)
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization (Q2634354) (← links)
- Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation (Q2676160) (← links)
- Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods (Q2693782) (← links)
- A limited-memory trust-region method for nonlinear optimization with many equality constraints (Q2695671) (← links)
- Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition (Q2696921) (← links)
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization (Q2696932) (← links)
- Backward Step Control for Global Newton-Type Methods (Q2788626) (← links)
- A second-order globally convergent direct-search method and its worst-case complexity (Q2810113) (← links)
- Adaptive augmented Lagrangian methods: algorithms and practical numerical experience (Q2811487) (← links)
- Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints (Q2815544) (← links)
- Null-Space Preconditioners for Saddle Point Systems (Q2818269) (← links)
- Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations (Q2831075) (← links)
- A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds (Q2945124) (← links)
- Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections (Q2947227) (← links)
- A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results (Q2949516) (← links)
- Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization (Q3300857) (← links)
- A Solver for Nonconvex Bound-Constrained Quadratic Optimization (Q3454512) (← links)
- A globally convergent gradient-like method based on the Armijo line search (Q5080090) (← links)
- Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
- An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians (Q6038658) (← links)
- Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (Q6046826) (← links)
