The following pages link to SifDec (Q16274):
Displaying 50 items.
- Some modified conjugate gradient methods for unconstrained optimization (Q277201) (← links)
- Trust region algorithm with two subproblems for bound constrained problems (Q279647) (← links)
- An optimal parameter for Dai-Liao family of conjugate gradient methods (Q289129) (← links)
- A stabilized filter SQP algorithm for nonlinear programming (Q312472) (← links)
- A family of second-order methods for convex \(\ell _1\)-regularized optimization (Q312690) (← links)
- Primal and dual active-set methods for convex quadratic programming (Q312693) (← links)
- A restoration-free filter SQP algorithm for equality constrained optimization (Q371507) (← links)
- Symmetric Perry conjugate gradient method (Q377723) (← links)
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization (Q377728) (← links)
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization (Q396257) (← links)
- Sobolev seminorm of quadratic functions with applications to derivative-free optimization (Q403635) (← links)
- Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian (Q409817) (← links)
- On the local convergence of a derivative-free algorithm for least-squares minimization (Q429479) (← links)
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization (Q429499) (← links)
- How good are extrapolated bi-projection methods for linear feasibility problems? (Q429520) (← links)
- A primal-dual augmented Lagrangian (Q434173) (← links)
- TRESNEI, a MATLAB trust-region solver for systems of nonlinear equalities and inequalities (Q434175) (← links)
- A combined class of self-scaling and modified quasi-Newton methods (Q453615) (← links)
- An improved nonlinear conjugate gradient method with an optimal property (Q476750) (← links)
- A variance-based method to rank input variables of the mesh adaptive direct search algorithm (Q479211) (← links)
- Study of a primal-dual algorithm for equality constrained minimization (Q480924) (← links)
- An adaptive augmented Lagrangian method for large-scale constrained optimization (Q494324) (← links)
- Optimization of algorithms with OPAL (Q495935) (← links)
- Dai-Kou type conjugate gradient methods with a line search only using gradient (Q522525) (← links)
- Global optimization test problems based on random field composition (Q523165) (← links)
- Structured regularization for barrier NLP solvers (Q523568) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013) (← links)
- Inverse problems and solution methods for a class of nonlinear complementarity problems (Q540647) (← links)
- An interior-point piecewise linear penalty method for nonlinear programming (Q543401) (← links)
- Combining and scaling descent and negative curvature directions (Q543412) (← links)
- Active-set strategy in Powell's method for optimization without derivatives (Q545940) (← links)
- Convergence analysis of sparse quasi-Newton updates with positive definite matrix completion for two-dimensional functions (Q550506) (← links)
- CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm (Q557727) (← links)
- A non-monotone line search algorithm for unconstrained optimization (Q618548) (← links)
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization (Q635233) (← links)
- Outer trust-region method for constrained optimization (Q637557) (← links)
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates (Q645035) (← links)
- Erratum to: ``Nonlinear programming without a penalty function or a filter'' (Q662297) (← links)
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396) (← links)
- Updating the regularization parameter in the adaptive cubic regularization algorithm (Q694543) (← links)
- A filter trust-region algorithm for unconstrained optimization with strong global convergence properties (Q694595) (← links)
- A curvilinear method based on minimal-memory BFGS updates (Q711340) (← links)
- Convergence analysis of a modified BFGS method on convex minimizations (Q711385) (← links)
- A limited memory steepest descent method (Q715093) (← links)
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization (Q715240) (← links)
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming (Q732237) (← links)
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization (Q732778) (← links)
- A regularized Newton method without line search for unconstrained optimization (Q742310) (← links)
- A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization (Q743777) (← links)
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization (Q745223) (← links)
