Cited in
(only showing first 100 items - show all)- LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems
- Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations
- scientific article; zbMATH DE number 3881771 (Why is no real title available?)
- scientific article; zbMATH DE number 3930730 (Why is no real title available?)
- Block BFGS methods
- The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method
- scientific article; zbMATH DE number 88930 (Why is no real title available?)
- Local and Superlinear Convergence for Partially Known Quasi-Newton Methods
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
- Convergence of quasi-Newton matrices generated by the symmetric rank one update
- Large scale portfolio optimization with piecewise linear transaction costs
- Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation
- Computing Gradients in Large-Scale Optimization Using Automatic Differentiation
- CUTE
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Estimating reducible stochastic differential equations by conversion to a least-squares problem
- On the existence of convex decompositions of partially separable functions
- On large-scale unconstrained optimization problems and higher order methods
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- On the Use of Product Structure in Secant Methods for Nonlinear Least Squares Problems
- Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- Algorithm 896: LSA: algorithms for large-scale optimization
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- A hybrid Hooke and Jeeves -- direct method for non-smooth optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- BBVSCG
- BTN
- CsegGraph
- LANCELOT
- LSNNO
- SIGMA_
- TNPACK
- MOTGA
- CUTEr
- Algorithm 739
- QPA
- MINPACK-2
- OPALQP
- UFO
- Filtrane
- Algorithm 611
- NLPHOPDM
- PFNRN
- minpack
- tn
- FastDer++
- HQP
- Primal interior-point method for large sparse minimax optimization
- scientific article; zbMATH DE number 1552017 (Why is no real title available?)
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- CUTE
- CGOPT
- edge_push_sp
- hess_pat
- Odyssee
- Algorithm 709
- Numerical Solution of Large Sets of Algebraic Nonlinear Equations
- VE10
- LSA
- NLPNET
- blockSQP
- liftedCollocation
- Livarh
- Livarhacc
- MMLA1Q
- OPFSDR
- Numerical methods for large-scale nonlinear optimization
- scientific article; zbMATH DE number 3936369 (Why is no real title available?)
- A Broyden class of quasi-Newton methods for Riemannian optimization
- scientific article; zbMATH DE number 1639657 (Why is no real title available?)
- On the Behavior of Broyden’s Class of Quasi-Newton Methods
- scientific article; zbMATH DE number 992821 (Why is no real title available?)
- Sparsity in higher order methods for unconstrained optimization
- The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study
- Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
- New line search methods for unconstrained optimization
- A modified BFGS method and its global convergence in nonconvex minimization
- scientific article; zbMATH DE number 653037 (Why is no real title available?)
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- On the limited memory BFGS method for large scale optimization
- The Local Convergence of Broyden-Like Methods on Lipschitzian Problems in Hilbert Spaces
- Recent progress in unconstrained nonlinear optimization without derivatives
- Convergence analysis of a modified BFGS method on convex minimizations
- Some bounds on the complexity of gradients, Jacobians, and Hessians
- Recognizing underlying sparsity in optimization
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Automatic differentiation for solving nonlinear partial differential equations: an efficient operator overloading approach
- New limited memory bundle method for large-scale nonsmooth optimization
- A new backtracking inexact BFGS method for symmetric nonlinear equations
- New quasi-Newton methods for unconstrained optimization problems
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
- Modified limited memory BFGS method with nonmonotone line search for unconstrained optimization
- Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
This page was built for software: ve08
