The following pages link to ve08 (Q17281):
Displaying 9 items.
- A trust-region-based BFGS method with line search technique for symmetric nonlinear equations (Q606189) (← links)
- On large scale nonlinear network optimization (Q908858) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix (Q1694296) (← links)
- New quasi-Newton methods for unconstrained optimization problems (Q2493696) (← links)
- On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization (Q2902870) (← links)
- LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems (Q4371805) (← links)
- SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS (Q5505738) (← links)
- Optimizing partially separable functions without derivatives (Q5717536) (← links)
