The following pages link to ve08 (Q17281):
Displaying 50 items.
- The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique (Q2181683) (← links)
- A note on solving nonlinear optimization problems in variable precision (Q2191797) (← links)
- The projection technique for two open problems of unconstrained optimization problems (Q2194129) (← links)
- Optimization techniques for tree-structured nonlinear problems (Q2221477) (← links)
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search (Q2290291) (← links)
- A unified convergence framework for nonmonotone inexact decomposition methods (Q2301131) (← links)
- Solving reachability problems by a scalable constrained optimization method (Q2303529) (← links)
- The global convergence of a modified BFGS method for nonconvex functions (Q2402402) (← links)
- A conjugate directions approach to improve the limited-memory BFGS method (Q2449186) (← links)
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363) (← links)
- Survey of trust-region derivative free optimization methods (Q2469806) (← links)
- The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization (Q2479147) (← links)
- New quasi-Newton methods for unconstrained optimization problems (Q2493696) (← links)
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization (Q2501110) (← links)
- New line search methods for unconstrained optimization (Q2510603) (← links)
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems (Q2719240) (← links)
- (Q2738483) (← links)
- Some bounds on the complexity of gradients, Jacobians, and Hessians (Q2743963) (← links)
- Nonlinear (local) optimization. The state of the art (Q2773632) (← links)
- A nonmonotone Broyden method for unconstrained optimization (Q2778682) (← links)
- A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares (Q2841158) (← links)
- Sparsity in higher order methods for unconstrained optimization (Q2885474) (← links)
- On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization (Q2902870) (← links)
- A Broyden Class of Quasi-Newton Methods for Riemannian Optimization (Q2945125) (← links)
- Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds (Q2958803) (← links)
- Algorithm 896 (Q2989073) (← links)
- A Quasi-Newton Method for Elliptic Boundary Value Problems (Q3028264) (← links)
- Global convergence of the partitioned BFGS algorithm for convex partially separable optimization (Q3030592) (← links)
- (Q3057247) (← links)
- Preconditioner updates for solving sequences of linear systems in matrix-free environment (Q3090810) (← links)
- Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization (Q3096872) (← links)
- (Q3125551) (← links)
- (Q3145782) (← links)
- (Q3203937) (← links)
- (Q3313207) (← links)
- (Q3347190) (← links)
- (Q3348724) (← links)
- (Q3397673) (← links)
- Numerical methods for large-scale nonlinear optimization (Q3430648) (← links)
- Local Convergence of Secant Methods for Nonlinear Constrained Optimization (Q3476213) (← links)
- Local Convergence Theory of Inexact Newton Methods Based on Structured Least Change Updates (Q3489363) (← links)
- (Q3552458) (← links)
- On large-scale unconstrained optimization problems and higher order methods (Q3562406) (← links)
- MODIFIED LIMITED MEMORY BFGS METHOD WITH NONMONOTONE LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION (Q3576364) (← links)
- (Q3583407) (← links)
- Large scale portfolio optimization with piecewise linear transaction costs (Q3605210) (← links)
- (Q3694574) (← links)
- (Q3703595) (← links)
- (Q3707252) (← links)
- (Q3746803) (← links)
