The following pages link to SifDec (Q16274):
Displaying 50 items.
- A modified BFGS algorithm based on a hybrid secant equation (Q763667) (← links)
- Variable parameter Uzawa method for solving a class of block three-by-three saddle point problems (Q827073) (← links)
- Starting-point strategies for an infeasible potential reduction method (Q845561) (← links)
- An inexact Newton method for nonconvex equality constrained optimization (Q847853) (← links)
- Monotone projected gradient methods for large-scale box-constrained quadratic programming (Q862715) (← links)
- A note on the use of vector barrier parameters for interior-point methods (Q877030) (← links)
- Modification of the Wolfe line search rules to satisfy the descent condition in the Polak-Ribière-Polyak conjugate gradient method (Q933809) (← links)
- A derivative-free algorithm for systems of nonlinear inequalities (Q941047) (← links)
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts (Q953208) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- A retrospective trust-region method for unconstrained optimization (Q964178) (← links)
- On solving trust-region and other regularised subproblems in optimization (Q977328) (← links)
- Trust-region and other regularisations of linear least-squares problems (Q1014897) (← links)
- A modified PRP conjugate gradient method (Q1026553) (← links)
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
- A new regularized quasi-Newton algorithm for unconstrained optimization (Q1636866) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme (Q1653949) (← links)
- An improved Perry conjugate gradient method with adaptive parameter choice (Q1656676) (← links)
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space (Q1657403) (← links)
- Line search filter inexact secant methods for nonlinear equality constrained optimization (Q1663551) (← links)
- A spectral dai-yuan-type conjugate gradient method for unconstrained optimization (Q1666716) (← links)
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems (Q1673895) (← links)
- A nonmonotone weighting self-adaptive trust region algorithm for unconstrained nonconvex optimization (Q1723529) (← links)
- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints (Q1724113) (← links)
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
- MINQ8: general definite and bound constrained indefinite quadratic programming (Q1744884) (← links)
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299) (← links)
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search (Q1757395) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- A primal-dual regularized interior-point method for convex quadratic programs (Q1762462) (← links)
- A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent (Q1810966) (← links)
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems (Q1890303) (← links)
- Evaluating bound-constrained minimization software (Q1928747) (← links)
- An active set feasible method for large-scale minimization problems with bound constraints (Q1928749) (← links)
- Efficient use of parallelism in algorithmic parameter optimization applications (Q1941182) (← links)
- On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds (Q1941187) (← links)
- Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
- Combining cross-entropy and MADS methods for inequality constrained global optimization (Q1981930) (← links)
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization (Q2041515) (← links)
- Compact representations of structured BFGS matrices (Q2044571) (← links)
- The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique (Q2067951) (← links)
- A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems (Q2072782) (← links)
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
- Two classes of spectral conjugate gradient methods for unconstrained optimizations (Q2103158) (← links)
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations (Q2125067) (← links)
- A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization (Q2140823) (← links)
- An extended projected residual algorithm for solving smooth convex optimization problems (Q2141614) (← links)
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing (Q2142552) (← links)
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration (Q2163451) (← links)
