The following pages link to ve08 (Q17281):
Displaying 47 items.
- The Local Convergence of Broyden-Like Methods on Lipschitzian Problems in Hilbert Spaces (Q3763498) (← links)
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables (Q3788978) (← links)
- The solution of partially separable linear equations on parallel processing systems (Q3975667) (← links)
- On the Impact of Automatic Differentiation on the Relative Performance of Parallel Truncated Newton and Variable Metric Algorithms (Q4012428) (← links)
- On the Behavior of Broyden’s Class of Quasi-Newton Methods (Q4015449) (← links)
- (Q4016506) (← links)
- Local and Superlinear Convergence for Partially Known Quasi-Newton Methods (Q4017638) (← links)
- (Q4023146) (← links)
- On the Relation between Two Local Convergence Theories of Least-Change Secant Update Methods (Q4031574) (← links)
- (Q4039213) (← links)
- Inexact Secant Methods for Nonlinear Constrained Optimization (Q4207529) (← links)
- A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence (Q4239757) (← links)
- On the Use of Product Structure in Secant Methods for Nonlinear Least Squares Problems (Q4294746) (← links)
- (Q4308912) (← links)
- Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation (Q4354079) (← links)
- Computing Gradients in Large-Scale Optimization Using Automatic Differentiation (Q4354939) (← links)
- CUTE (Q4371578) (← links)
- LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems (Q4371805) (← links)
- (Q4524222) (← links)
- A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information (Q4634097) (← links)
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141) (← links)
- Block BFGS Methods (Q4641646) (← links)
- Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions (Q4646680) (← links)
- On efficient Hessian computation using the edge pushing algorithm in Julia (Q4685595) (← links)
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations (Q4699107) (← links)
- Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region (Q4717557) (← links)
- Numerical Solution of Large Sets of Algebraic Nonlinear Equations (Q4721542) (← links)
- On Large Scale Nonlinear Least Squares Calculations (Q4725597) (← links)
- An Optimal Positive Definite Update for Sparse Hessian Matrices (Q4764315) (← links)
- A Class of Trust Region Methods for Nonlinear Network Optimization Problems (Q4838960) (← links)
- (Q4840584) (← links)
- (Q4867038) (← links)
- (Q4876333) (← links)
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization (Q4883667) (← links)
- On the existence of convex decompositions of partially separable functions (Q5186653) (← links)
- Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization (Q5287107) (← links)
- Trust-region interior-point method for large sparse<i>l</i><sub>1</sub>optimization (Q5437524) (← links)
- New limited memory bundle method for large-scale nonsmooth optimization (Q5460656) (← links)
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity (Q5470252) (← links)
- Exploiting problem structure in pattern search methods for unconstrained optimization (Q5475286) (← links)
- Computing the sparsity pattern of Hessians using automatic differentiation (Q5498686) (← links)
- SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS (Q5505738) (← links)
- Optimizing partially separable functions without derivatives (Q5717536) (← links)
- Greedy Quasi-Newton Methods with Explicit Superlinear Convergence (Q5853572) (← links)
- Adjoint-based SQP method with block-wise quasi-Newton Jacobian updates for nonlinear optimal control (Q5865331) (← links)
- Stable factorized quasi-Newton methods for nonlinear least-squares problems (Q5936067) (← links)
- A modified BFGS method and its global convergence in nonconvex minimization (Q5936068) (← links)
