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 (only showing first 100 items - show all)
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
This page was built for publication: CUTEr and SifDec
