SIFDecode
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Trust-region and other regularisations of linear least-squares problems
- A modified PRP conjugate gradient method
- KNITRO
- LANCELOT
- MA57
- NEWUOA
- PSwarm
- QPDO
- SLMQN
- SPG
- STRSCNE
- PREQN
- L-BFGS-B
- GALAHAD
- LOQO
- SNOPT
- CONDOR
- L-BFGS
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization
- testenv
- CUTEr
- LIBOPT
- A new regularized quasi-Newton algorithm for unconstrained optimization
- Best practices for comparing optimization algorithms
- QPA
- 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
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
- APPSPACK
- Algorithm 739
- Line search filter inexact secant methods for nonlinear equality constrained optimization
- A spectral dai-yuan-type conjugate gradient method for unconstrained optimization
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
- TRON
- LSTRS
- DFO
- NNLS
- TANGO
- WEDGE
- ipfilter
- CG_DESCENT
- IMFIL
- KELLEY
- IP-PCG
- 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
- MINQ
- COBYLA2
- tn
- ve08
- nlpy
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- Filtrane
- MVE
- TRICE
- TRESNEI
- CG+
- MINQ8: general definite and bound constrained indefinite quadratic programming
- minpack
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- PIGALE
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A primal-dual regularized interior-point method for convex quadratic programs
- AMLET
- OPAL
- A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- Evaluating bound-constrained minimization software
- An active set feasible method for large-scale minimization problems with bound constraints
- 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
- GQTPAR
- Benchmarking nonlinear optimization software in technical computing environments
- OrthoMADS
- Combining cross-entropy and MADS methods for inequality constrained global optimization
- QPOPT
- Algorithm 738
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- Compact representations of structured BFGS matrices
- SCALCG
- COPS
- MSS
- 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
- 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 regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations
- 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 new family of hybrid three-term conjugate gradient methods with applications in image restoration
- A comparison of methods for traversing regions of non-convexity in optimization problems
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- Nonmonotone adaptive trust region method with line search based on new diagonal updating
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- CGOPT
This page was built for software: SIFDecode
