ve08

MaRDI QIDQ17281swMATHFDO

Official website https://www.netlib.org/opt/ve08

Described by source

• scientific article; zbMATH DE number 3898623 (Why is no real title available?)
• Local convergence analysis for partitioned quasi-Newton updates
• Partitioned variable metric updates for large structured optimization problems

Cited in

(only showing first 100 items - show all)

• CUTE
• CGOPT
• edge_push_sp
• hess_pat
• Odyssee
• Algorithm 709
• VE10
• LSA
• NLPNET
• blockSQP
• liftedCollocation
• Livarh
• Livarhacc
• MMLA1Q
• OPFSDR
• On the Impact of Automatic Differentiation on the Relative Performance of Parallel Truncated Newton and Variable Metric Algorithms
• Approximating Hessians in unconstrained optimization arising from discretized problems
• Corrected sequential linear programming for sparse minimax optimization
• Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares
• Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions
• A Broyden class of quasi-Newton methods for Riemannian optimization
• scientific article; zbMATH DE number 107545 (Why is no real title available?)
• scientific article; zbMATH DE number 992821 (Why is no real title available?)
• scientific article; zbMATH DE number 653037 (Why is no real title available?)
• Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
• Primal interior point method for minimization of generalized minimax functions
• Block BFGS methods
• New limited memory bundle method for large-scale nonsmooth optimization
• CUTE
• Computing the sparsity pattern of Hessians using automatic differentiation
• Some bounds on the complexity of gradients, Jacobians, and Hessians
• Stable factorized quasi-Newton methods for nonlinear least-squares problems
• Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization
• An Optimal Positive Definite Update for Sparse Hessian Matrices
• Sparsity in higher order methods for unconstrained optimization
• scientific article; zbMATH DE number 847990 (Why is no real title available?)
• Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
• On the existence of convex decompositions of partially separable functions
• New quasi-Newton methods for unconstrained optimization problems
• A family of the local convergence of the improved secant methods for nonlinear equality constrained optimization subject to bounds on variables
• Optimizing partially separable functions without derivatives
• scientific article; zbMATH DE number 3843081 (Why is no real title available?)
• Nonlinear (local) optimization. The state of the art
• The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions
• A parallel quasi-Newton algorithm for unconstrained optimization
• Learning general sparse additive models from point queries in high dimensions
• The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions
• scientific article; zbMATH DE number 872679 (Why is no real title available?)
• Analysis of sparse quasi-Newton updates with positive definite matrix completion
• On large-scale unconstrained optimization problems and higher order methods
• Graph coloring in the estimation of sparse derivative matrices: Instances and applications
• Trust-region interior-point method for large sparsel₁optimization
• On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
• Variable metric methods for unconstrained optimization and nonlinear least squares
• Recent progress in unconstrained nonlinear optimization without derivatives
• Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods
• Sparse quasi-Newton updates with positive definite matrix completion
• scientific article; zbMATH DE number 3982416 (Why is no real title available?)
• On the limited memory BFGS method for large scale optimization
• The projection technique for two open problems of unconstrained optimization problems
• scientific article; zbMATH DE number 3919686 (Why is no real title available?)
• A unified convergence framework for nonmonotone inexact decomposition methods
• Solving reachability problems by a scalable constrained optimization method
• Inexact Secant Methods for Nonlinear Constrained Optimization
• scientific article; zbMATH DE number 3881771 (Why is no real title available?)
• scientific article; zbMATH DE number 3930730 (Why is no real title available?)
• Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
• The two-stage recombination operator and its application to the multiobjective 0/1 knapsack problem: A comparative study
• Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation
• Computing Gradients in Large-Scale Optimization Using Automatic Differentiation
• Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• Automatic differentiation for solving nonlinear partial differential equations: an efficient operator overloading approach
• Estimating reducible stochastic differential equations by conversion to a least-squares problem
• scientific article; zbMATH DE number 778135 (Why is no real title available?)
• An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
• Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
• scientific article; zbMATH DE number 88930 (Why is no real title available?)
• Large scale portfolio optimization with piecewise linear transaction costs
• A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
• Numerical Solution of Large Sets of Algebraic Nonlinear Equations
• Algorithm 896: LSA: algorithms for large-scale optimization
• Unconstrained duals to partially separable constrained programs
• Partitioned quasi-Newton methods for sparse nonlinear equations
• The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization
• A rank-one fitting method for solving symmetric nonlinear equations
• scientific article; zbMATH DE number 18298 (Why is no real title available?)
• Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization
• A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information
• MINPACK
• On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
• Local and Superlinear Convergence for Partially Known Quasi-Newton Methods
• The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden
• The global convergence of a modified BFGS method for nonconvex functions
• A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems
• Optimization techniques for tree-structured nonlinear problems
• Separation process optimization calculations
• A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares
• On the Use of Product Structure in Secant Methods for Nonlinear Least Squares Problems
• A partitioned PSB method for partially separable unconstrained optimization problems

This page was built for software: ve08