CUTEr and SifDec
From MaRDI portal
Publication:5461068
DOI10.1145/962437.962439zbMath1068.90526OpenAlexW2085137170WikidataQ58185826 ScholiaQ58185826MaRDI QIDQ5461068
Nicholas I. M. Gould, Dominique Orban, Phillipe L. Toint
Publication date: 21 July 2005
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/962437.962439
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
A hybrid scaling parameter for the scaled memoryless BFGS method based on the ℓ∞ matrix norm ⋮ An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization ⋮ Inexact variable metric method for convex-constrained optimization problems ⋮ Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem ⋮ A non-monotone trust region algorithm for unconstrained optimization with dynamic reference iteration updates using filter ⋮ Two optimal Dai–Liao conjugate gradient methods ⋮ New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters ⋮ A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach ⋮ A new class of efficient and globally convergent conjugate gradient methods in the Dai–Liao family ⋮ Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems ⋮ Designing an Optimal Search Algorithm with Respect to Prior Information ⋮ A modified conjugate gradient method based on a modified secant equation ⋮ Using constraint preconditioners with regularized saddle-point problems ⋮ An interior point method for nonlinear programming with infeasibility detection capabilities ⋮ Shifted L-BFGS systems ⋮ New conjugate gradient-like methods for unconstrained optimization ⋮ Solving polynomial least squares problems via semidefinite programming relaxations ⋮ Improved convergence order for augmented penalty algorithms ⋮ An inexact projected LM type algorithm for solving convex constrained nonlinear equations ⋮ An augmented Lagrangian trust region method for equality constrained optimization ⋮ A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds ⋮ Two families of self-adjusting spectral hybrid DL conjugate gradient methods and applications in image denoising ⋮ A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations ⋮ An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method ⋮ Two families of hybrid conjugate gradient methods with restart procedures and their applications ⋮ A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems ⋮ Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing ⋮ A three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression model ⋮ A hybrid BB-type method for solving large scale unconstrained optimization ⋮ A family of the modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent and conjugacy conditions ⋮ A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization ⋮ A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM ⋮ A block triangular preconditioner for a class of three-by-three block saddle point problems ⋮ A restart scheme for the memoryless BFGS method ⋮ A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method ⋮ Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization ⋮ A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints ⋮ Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition ⋮ A modified conjugate gradient method for general convex functions ⋮ A modified secant equation quasi-Newton method for unconstrained optimization ⋮ Unnamed Item ⋮ A modified Hestenes–Stiefel conjugate gradient method with an optimal property ⋮ A new modified scaled conjugate gradient method for large-scale unconstrained optimization with non-convex objective function ⋮ Unnamed Item ⋮ An adaptive nonmonotone trust region algorithm ⋮ Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques ⋮ A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice ⋮ A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information ⋮ The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables ⋮ Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization ⋮ An alternative globalization strategy for unconstrained optimization ⋮ Improving the Dai-Liao parameter choices using a fixed point equation ⋮ A NONMONOTONE FILTER BARZILAI-BORWEIN METHOD FOR OPTIMIZATION ⋮ AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY ⋮ Optimizing partially separable functions without derivatives ⋮ A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems ⋮ Use of quadratic models with mesh-adaptive direct search for constrained black box optimization ⋮ A new nonmonotone line search technique for unconstrained optimization ⋮ Sparse Hessian factorization in curved trajectories for unconstrained minimization ⋮ A filter-trust-region method for simple-bound constrained optimization ⋮ Unnamed Item ⋮ Worst case complexity of direct search under convexity ⋮ An efficient adaptive scaling parameter for the spectral conjugate gradient method ⋮ A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems ⋮ A Conjugate Gradient Method Based on a Modified Secant Relation for Unconstrained Optimization ⋮ A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization ⋮ Adaptive augmented Lagrangian methods: algorithms and practical numerical experience ⋮ MATRIX ANALYSES ON THE DAI–LIAO CONJUGATE GRADIENT METHOD ⋮ A descent hybrid modification of the Polak–Ribière–Polyak conjugate gradient method ⋮ Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case ⋮ An active-set trust-region method for derivative-free nonlinear bound-constrained optimization ⋮ A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques ⋮ How much do approximate derivatives hurt filter methods? ⋮ Two hybrid nonlinear conjugate gradient methods based on a modified secant equation ⋮ An adaptive nonmonotone trust region method based on a modified scalar approximation of the Hessian in the successive quadratic subproblems ⋮ Direct Search Based on Probabilistic Descent ⋮ Unnamed Item ⋮ Computationally Efficient Decompositions of Oblique Projection Matrices ⋮ Unnamed Item ⋮ A trust region method based on a new affine scaling technique for simple bounded optimization ⋮ A modified two-point stepsize gradient algorithm for unconstrained minimization ⋮ From global to local convergence of interior methods for nonlinear optimization ⋮ A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter ⋮ An affine-scaling derivative-free trust-region method for solving nonlinear systems subject to linear inequality constraints ⋮ Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation ⋮ Algorithm 943 ⋮ A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization ⋮ Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization ⋮ Mesh-based Nelder-Mead algorithm for inequality constrained optimization ⋮ Some modified conjugate gradient methods for unconstrained optimization ⋮ Trust region algorithm with two subproblems for bound constrained problems ⋮ Variable parameter Uzawa method for solving a class of block three-by-three saddle point problems ⋮ An optimal parameter for Dai-Liao family of conjugate gradient methods ⋮ A modified scaling parameter for the memoryless BFGS updating formula ⋮ A new regularized quasi-Newton algorithm for unconstrained optimization ⋮ A stabilized filter SQP algorithm for nonlinear programming ⋮ A family of second-order methods for convex \(\ell _1\)-regularized optimization ⋮ Primal and dual active-set methods for convex quadratic programming ⋮ Starting-point strategies for an infeasible potential reduction method ⋮ An inexact Newton method for nonconvex equality constrained optimization ⋮ Best practices for comparing optimization algorithms ⋮ Two accelerated nonmonotone adaptive trust region line search methods ⋮ Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme ⋮ An improved Perry conjugate gradient method with adaptive parameter choice ⋮ Monotone projected gradient methods for large-scale box-constrained quadratic programming ⋮ Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space ⋮ A modified nearly exact method for solving low-rank trust region subproblem ⋮ Line search filter inexact secant methods for nonlinear equality constrained optimization ⋮ A spectral dai-yuan-type conjugate gradient method for unconstrained optimization ⋮ A restoration-free filter SQP algorithm for equality constrained optimization ⋮ A note on the use of vector barrier parameters for interior-point methods ⋮ Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems ⋮ Symmetric Perry conjugate gradient method ⋮ Preconditioning Newton-Krylov methods in nonconvex large scale optimization ⋮ Two modified scaled nonlinear conjugate gradient methods ⋮ A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization ⋮ A non-monotone line search algorithm for unconstrained optimization ⋮ Sobolev seminorm of quadratic functions with applications to derivative-free optimization ⋮ Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian ⋮ A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems ⋮ A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems ⋮ On the nonmonotonicity degree of nonmonotone line searches ⋮ Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization ⋮ How good are extrapolated bi-projection methods for linear feasibility problems? ⋮ A projected-gradient interior-point algorithm for complementarity problems ⋮ A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization ⋮ A primal-dual augmented Lagrangian ⋮ TRESNEI, a MATLAB trust-region solver for systems of nonlinear equalities and inequalities ⋮ Outer trust-region method for constrained optimization ⋮ Two effective hybrid conjugate gradient algorithms based on modified BFGS updates ⋮ On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints ⋮ A combined class of self-scaling and modified quasi-Newton methods ⋮ A nonmonotone weighting self-adaptive trust region algorithm for unconstrained nonconvex optimization ⋮ The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints ⋮ Sparse quasi-Newton updates with positive definite matrix completion ⋮ An indicator for the switch from derivative-free to derivative-based optimization ⋮ An improved nonlinear conjugate gradient method with an optimal property ⋮ A variance-based method to rank input variables of the mesh adaptive direct search algorithm ⋮ Two modified three-term conjugate gradient methods with sufficient descent property ⋮ An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization ⋮ Modification of the Wolfe line search rules to satisfy the descent condition in the Polak-Ribière-Polyak conjugate gradient method ⋮ Study of a primal-dual algorithm for equality constrained minimization ⋮ An affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming ⋮ Analysis of sparse quasi-Newton updates with positive definite matrix completion ⋮ A derivative-free algorithm for systems of nonlinear inequalities ⋮ A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization ⋮ An adaptive augmented Lagrangian method for large-scale constrained optimization ⋮ Globally convergent evolution strategies ⋮ Optimization of algorithms with OPAL ⋮ MINQ8: general definite and bound constrained indefinite quadratic programming ⋮ Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts ⋮ On optimality of two adaptive choices for the parameter of Dai-Liao method ⋮ Dai-Kou type conjugate gradient methods with a line search only using gradient ⋮ Global optimization test problems based on random field composition ⋮ Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm ⋮ A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update ⋮ Structured regularization for barrier NLP solvers ⋮ A coordinate gradient descent method for nonsmooth separable minimization ⋮ A modified three-term PRP conjugate gradient algorithm for optimization models ⋮ Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search ⋮ A modified three-term conjugate gradient method with sufficient descent property ⋮ A retrospective trust-region method for unconstrained optimization ⋮ Updating the regularization parameter in the adaptive cubic regularization algorithm ⋮ A filter trust-region algorithm for unconstrained optimization with strong global convergence properties ⋮ Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results ⋮ Inverse problems and solution methods for a class of nonlinear complementarity problems ⋮ An interior-point piecewise linear penalty method for nonlinear programming ⋮ Combining and scaling descent and negative curvature directions ⋮ CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm ⋮ On solving trust-region and other regularised subproblems in optimization ⋮ A curvilinear method based on minimal-memory BFGS updates ⋮ Convergence analysis of a modified BFGS method on convex minimizations ⋮ A limited memory steepest descent method ⋮ Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization ⋮ A modified nonmonotone trust region line search method ⋮ A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique ⋮ Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming ⋮ A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization ⋮ A regularized Newton method without line search for unconstrained optimization ⋮ A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization ⋮ Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization ⋮ Recognizing underlying sparsity in optimization ⋮ Trust-region and other regularisations of linear least-squares problems ⋮ CUTEr ⋮ SifDec ⋮ A modified PRP conjugate gradient method ⋮ A modified BFGS algorithm based on a hybrid secant equation ⋮ A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems ⋮ A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization ⋮ A nonmonotone inexact Newton method for unconstrained optimization ⋮ Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update ⋮ New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming ⋮ A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations ⋮ A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization ⋮ A globally convergent hybrid conjugate gradient method and its numerical behaviors ⋮ A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization ⋮ An extended projected residual algorithm for solving smooth convex optimization problems ⋮ Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing ⋮ A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization ⋮ A new trust region filter algorithm ⋮ On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization ⋮ A truncated Newton method in an augmented Lagrangian framework for nonlinear programming ⋮ Second-order negative-curvature methods for box-constrained and general constrained optimization ⋮ Optimal scaling parameters for spectral conjugate gradient methods ⋮ A penalty-interior-point algorithm for nonlinear constrained optimization ⋮ A new family of hybrid three-term conjugate gradient methods with applications in image restoration ⋮ On efficiently combining limited-memory and trust-region techniques ⋮ A frame-based conjugate gradients direct search method with radial basis function interpolation model ⋮ Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model ⋮ A hybrid quasi-Newton method with application in sparse recovery ⋮ A descent extension of the Polak-Ribière-Polyak conjugate gradient method ⋮ A modified nonmonotone BFGS algorithm for unconstrained optimization ⋮ A comparison of reduced and unreduced KKT systems arising from interior point methods ⋮ Evaluating bound-constrained minimization software ⋮ An active set feasible method for large-scale minimization problems with bound constraints ⋮ Spectral analysis of the preconditioned system for the \(3 \times 3\) block saddle point problem ⋮ An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities ⋮ An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization ⋮ A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods ⋮ A comparison of methods for traversing regions of non-convexity in optimization problems ⋮ A modified scaled memoryless symmetric rank-one method ⋮ A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions ⋮ Efficient use of parallelism in algorithmic parameter optimization applications ⋮ On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds ⋮ How good are projection methods for convex feasibility problems? ⋮ Local analysis of the feasible primal-dual interior-point method ⋮ A trust region affine scaling method for bound constrained optimization ⋮ Benchmarking nonlinear optimization software in technical computing environments ⋮ A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization ⋮ A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement ⋮ A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties ⋮ Global convergence of a general filter algorithm based on an efficiency condition of the step ⋮ On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems ⋮ Iterative computation of negative curvature directions in large scale optimization ⋮ Combining cross-entropy and MADS methods for inequality constrained global optimization ⋮ Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing ⋮ An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction ⋮ A new modified BFGS method for unconstrained optimization problems ⋮ Nonmonotone projected gradient methods based on barrier and Euclidean distances ⋮ An inexact and nonmonotone proximal method for smooth unconstrained minimization ⋮ Globally solving nonconvex quadratic programming problems via completely positive programming ⋮ A primal-dual regularized interior-point method for convex quadratic programs ⋮ An improved sequential quadratic programming algorithm for solving general nonlinear programming problems ⋮ Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length ⋮ Nonmonotone adaptive trust region method with line search based on new diagonal updating ⋮ On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming ⋮ A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations ⋮ An interior algorithm for nonlinear optimization that combines line search and trust region steps ⋮ A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods ⋮ A subspace implementation of quasi-Newton trust region methods for unconstrained optimization ⋮ Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems ⋮ Two adaptive Dai-Liao nonlinear conjugate gradient methods ⋮ A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization ⋮ New line search methods for unconstrained optimization ⋮ An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing ⋮ A feasible filter SQP algorithm with global and local convergence ⋮ The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices ⋮ A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations ⋮ On the use of iterative methods in cubic regularization for unconstrained optimization ⋮ A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization ⋮ Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search ⋮ New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization ⋮ Compact representations of structured BFGS matrices ⋮ Nonlinear analysis: optimization methods, convergence theory, and applications ⋮ Corrigendum to: ``Krasnosel'skii type hybrid fixed point theorems and their applications to fractional integral equations ⋮ An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization ⋮ A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update ⋮ Two nonmonotone trust region algorithms based on an improved Newton method ⋮ An improved nonmonotone adaptive trust region method. ⋮ The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique ⋮ A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems ⋮ A subspace minimization conjugate gradient method based on conic model for unconstrained optimization ⋮ A dense initialization for limited-memory quasi-Newton methods ⋮ A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function ⋮ Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing ⋮ A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction ⋮ An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix ⋮ A derivative-free trust-funnel method for equality-constrained nonlinear optimization ⋮ A nonmonotone hybrid conjugate gradient method for unconstrained optimization ⋮ Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems ⋮ Two classes of spectral conjugate gradient methods for unconstrained optimizations ⋮ A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization ⋮ Recent advances in trust region algorithms ⋮ CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization ⋮ Optimality properties of an augmented Lagrangian method on infeasible problems ⋮ Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing ⋮ The optimization test environment
Uses Software
