The following pages link to SifDec (Q16274):
Displaying 26 items.
- A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization (Q5026838) (← links)
- Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization (Q5028623) (← links)
- Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem (Q5038438) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- (Q5164439) (← links)
- A Derivative-Free Algorithm for Inequality Constrained Nonlinear Programming via Smoothing of an $\ell_\infty$ Penalty Function (Q5189549) (← links)
- An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations (Q5200258) (← links)
- Algorithm 943 (Q5270699) (← links)
- Constraint-Style Preconditioners for Regularized Saddle Point Problems (Q5301200) (← links)
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization (Q5317148) (← links)
- A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization (Q5317526) (← links)
- Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs (Q5320683) (← links)
- Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization (Q5320691) (← links)
- A filter-trust-region method for simple-bound constrained optimization (Q5437529) (← links)
- Minimizing the Condition Number for Small Rank Modifications (Q5446453) (← links)
- MA57---a code for the solution of sparse symmetric definite and indefinite systems (Q5461188) (← links)
- Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems (Q5470464) (← links)
- An Algebraic Analysis of a Block Diagonal Preconditioner for Saddle Point Systems (Q5470493) (← links)
- Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems (Q5470529) (← links)
- SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS (Q5505738) (← links)
- Optimizing partially separable functions without derivatives (Q5717536) (← links)
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization (Q5757343) (← links)
- Computationally Efficient Decompositions of Oblique Projection Matrices (Q5853710) (← links)
- A modified conjugate gradient method based on a modified secant equation (Q5855677) (← links)
- A new nonmonotone line search technique for unconstrained optimization (Q5919724) (← links)
- A new efficient conjugate gradient method for unconstrained optimization (Q5964605) (← links)
