ve08

swMATH5141MaRDI QIDQ17281FDOQ17281

Author name not available (Why is that?)

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

Described by source

• Partitioned variable metric updates for large structured optimization problems
• Local convergence analysis for partitioned quasi-Newton updates
• Unnamed Publication

Cited In (only showing first 100 items - show all)

• Local and Superlinear Convergence for Partially Known Quasi-Newton Methods
• 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
• A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Numerical methods for large-scale nonlinear optimization
• Title not available (Why is that?)
• On the Behavior of Broyden’s Class of Quasi-Newton Methods
• A hybrid Hooke and Jeeves -- direct method for non-smooth optimization
• Primal interior-point method for large sparse minimax optimization
• Preconditioner updates for solving sequences of linear systems in matrix-free environment
• A new backtracking inexact BFGS method for symmetric nonlinear equations
• Recognizing underlying sparsity in optimization
• An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
• Title not available (Why is that?)
• A modified BFGS method and its global convergence in nonconvex minimization
• Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations
• On diagonally structured problems in unconstrained optimization using an inexact super Halley method
• Convergence of quasi-Newton matrices generated by the symmetric rank one update
• Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
• On Large Scale Nonlinear Least Squares Calculations
• Title not available (Why is that?)
• Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
• SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS
• LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems
• The Local Convergence of Broyden-Like Methods on Lipschitzian Problems in Hilbert Spaces
• Convergence analysis of a modified BFGS method on convex minimizations
• Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
• New line search methods for unconstrained optimization
• An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
• Approximating Hessians in unconstrained optimization arising from discretized problems
• Title not available (Why is that?)
• BTN
• LSNNO
• A Broyden class of quasi-Newton methods for Riemannian optimization
• Title not available (Why is that?)
• SIGMA_
• TNPACK
• Algorithm 739
• MINPACK-2
• OPALQP
• UFO
• Filtrane
• Algorithm 611
• NLPHOPDM
• PFNRN
• minpack
• tn
• FastDer++
• HQP
• Title not available (Why is that?)
• New limited memory bundle method for large-scale nonsmooth optimization
• Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares
• Block BFGS methods
• CUTE
• CGOPT
• edge_push_sp
• hess_pat
• Odyssee
• CUTE
• Algorithm 709
• Some bounds on the complexity of gradients, Jacobians, and Hessians
• VE10
• LSA
• NLPNET
• blockSQP
• liftedCollocation
• Livarh
• Livarhacc
• MMLA1Q
• OPFSDR
• Sparsity in higher order methods for unconstrained optimization
• On the existence of convex decompositions of partially separable functions
• New quasi-Newton methods for unconstrained optimization problems
• The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions
• On large-scale unconstrained optimization problems and higher order methods
• 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
• On the limited memory BFGS method for large scale optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation
• Computing Gradients in Large-Scale Optimization Using Automatic Differentiation
• The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study
• 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
• Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
• Title not available (Why is that?)
• An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
• Large scale portfolio optimization with piecewise linear transaction costs
• Estimating reducible stochastic differential equations by conversion to a least-squares problem
• 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
• Title not available (Why is that?)
• The global convergence of a modified BFGS method for nonconvex functions
• The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden
• A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems
• Separation process optimization calculations

This page was built for software: ve08