CUTEr
From MaRDI portal
Software:16200
No author found.
Related Items (only showing first 100 items - show all)
A globally convergent penalty-free method for optimization with equality constraints and simple bounds ⋮ An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property ⋮ Efficient tridiagonal preconditioner for the matrix-free truncated Newton method ⋮ Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization ⋮ A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ On Hager and Zhang's conjugate gradient method with guaranteed descent ⋮ Some modified conjugate gradient methods for unconstrained optimization ⋮ New hybrid conjugate gradient method for unconstrained optimization ⋮ Spectral method and its application to the conjugate gradient method ⋮ Trust region algorithm with two subproblems for bound constrained problems ⋮ An optimal parameter for Dai-Liao family of conjugate gradient methods ⋮ A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints ⋮ A modified scaling parameter for the memoryless BFGS updating formula ⋮ 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 ⋮ An active set truncated Newton method for large-scale bound constrained optimization ⋮ On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems ⋮ An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems ⋮ A self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization ⋮ A restoration-free filter SQP algorithm for equality constrained optimization ⋮ Spectral scaling BFGS method ⋮ Symmetric Perry conjugate gradient method ⋮ Preconditioning Newton-Krylov methods in nonconvex large scale optimization ⋮ A practical relative error criterion for augmented Lagrangians ⋮ The convergence of conjugate gradient method with nonmonotone line search ⋮ A penalty-free method for equality constrained optimization ⋮ Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization ⋮ A nonmonotone retrospective trust-region method for unconstrained optimization ⋮ Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization ⋮ Two modified scaled nonlinear conjugate gradient methods ⋮ A simple sufficient descent method for unconstrained optimization ⋮ A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization ⋮ A non-monotone line search algorithm for unconstrained optimization ⋮ On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians ⋮ Sobolev seminorm of quadratic functions with applications to derivative-free optimization ⋮ Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian ⋮ Scaling on diagonal quasi-Newton update for large-scale unconstrained optimization ⋮ A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties ⋮ A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization ⋮ Improved Hessian approximation with modified secant equations for symmetric rank-one method ⋮ A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization ⋮ 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 ⋮ Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property ⋮ 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 ⋮ Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization ⋮ Modified active set projected spectral gradient method for bound constrained optimization ⋮ Globally convergent modified Perry's conjugate gradient method ⋮ The global convergence of a descent PRP conjugate gradient method ⋮ Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization ⋮ Recent advances in algorithmic differentiation. Selected papers based on the presentations at the 6th international conference on automatic differentiation (AD2012), Fort Collins, CO, USA, July 23--27, 2012. ⋮ Global convergence of a spectral conjugate gradient method for unconstrained optimization ⋮ Global convergence of some modified PRP nonlinear conjugate gradient methods ⋮ Two effective hybrid conjugate gradient algorithms based on modified BFGS updates ⋮ A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization ⋮ A combined class of self-scaling and modified quasi-Newton methods ⋮ Interior-point methods for nonconvex nonlinear programming: cubic regularization ⋮ A symmetric rank-one method based on extra updating techniques for unconstrained optimization ⋮ A sufficient descent LS conjugate gradient method for unconstrained optimization problems ⋮ A working set SQCQP algorithm with simple nonmonotone penalty parameters ⋮ Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing ⋮ 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 ⋮ Study of a primal-dual algorithm for equality constrained minimization ⋮ Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization ⋮ Global convergence of a nonmonotone trust region algorithm with memory for unconstrained optimization ⋮ qpOASES: a parametric active-set algorithm for~quadratic programming ⋮ Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search ⋮ 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 ⋮ An adaptive augmented Lagrangian method for large-scale constrained optimization ⋮ Globally convergent evolution strategies ⋮ Optimization of algorithms with OPAL ⋮ A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems ⋮ A limited memory descent Perry conjugate gradient method ⋮ 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 ⋮ A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update ⋮ Structured regularization for barrier NLP solvers ⋮ A modified three-term PRP conjugate gradient algorithm for optimization models ⋮ A modified three-term conjugate gradient method with sufficient descent property ⋮ An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments ⋮ Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results ⋮ Modified nonmonotone Armijo line search for descent method ⋮ A modified CG-DESCENT method for unconstrained optimization ⋮ A robust implementation of a sequential quadratic programming algorithm with successive error restoration ⋮ 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 ⋮ Active-set strategy in Powell's method for optimization without derivatives ⋮ A derivative-free trust-region algorithm for unconstrained optimization with controlled error ⋮ A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization ⋮ CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm
This page was built for software: CUTEr
