ve08 - MaRDI portal

Cited in

(only showing first 100 items - show all)

Recognizing underlying sparsity in optimization
Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
A new backtracking inexact BFGS method for symmetric nonlinear equations
The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden
Separation process optimization calculations
Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
Convergence of quasi-Newton matrices generated by the symmetric rank one update
Unconstrained duals to partially separable constrained programs
BBVSCG
BTN
CsegGraph
LANCELOT
LSNNO
Corrected sequential linear programming for sparse minimax optimization
SIGMA_
Recent progress in unconstrained nonlinear optimization without derivatives
TNPACK
MOTGA
Variable metric methods for unconstrained optimization and nonlinear least squares
Estimating reducible stochastic differential equations by conversion to a least-squares problem
CUTEr
QPA
Algorithm 739
UFO
MINPACK-2
An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
OPALQP
tn
NLPHOPDM
PFNRN
Filtrane
A partitioned PSB method for partially separable unconstrained optimization problems
Algorithm 611
minpack
An implementation of Newton-like methods on nonlinearly constrained networks
Global convergence of a class of collinear scaling algorithms with inexact line searches on convex functions
Automatic differentiation for solving nonlinear partial differential equations: an efficient operator overloading approach
An H-form variant of the partitioned QN method
Nonlinear model predictive control via feasibility-perturbed sequential quadratic programming
A parallel quasi-Newton algorithm for unconstrained optimization
FastDer++
Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
HQP
Learning general sparse additive models from point queries in high dimensions
High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
New results on superlinear convergence of classical quasi-Newton methods
Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
Rates of superlinear convergence for classical quasi-Newton methods
The global convergence of the BFGS method with a modified WWP line search for nonconvex functions
The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique
A note on solving nonlinear optimization problems in variable precision
The projection technique for two open problems of unconstrained optimization problems
Optimization techniques for tree-structured nonlinear problems
Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
CGOPT
A unified convergence framework for nonmonotone inexact decomposition methods
Solving reachability problems by a scalable constrained optimization method
hess_pat
edge_push_sp
The global convergence of a modified BFGS method for nonconvex functions
Odyssee
A conjugate directions approach to improve the limited-memory BFGS method
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
Survey of trust-region derivative free optimization methods
The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization
New quasi-Newton methods for unconstrained optimization problems
Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
New line search methods for unconstrained optimization
Algorithm 709
CUTE
On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
scientific article; zbMATH DE number 1639657 (Why is no real title available?)
Some bounds on the complexity of gradients, Jacobians, and Hessians
Nonlinear (local) optimization. The state of the art
A nonmonotone Broyden method for unconstrained optimization
A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares
Sparsity in higher order methods for unconstrained optimization
On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
A Broyden class of quasi-Newton methods for Riemannian optimization
Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
Algorithm 896: LSA: algorithms for large-scale optimization
A Quasi-Newton Method for Elliptic Boundary Value Problems
Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
Primal interior point method for minimization of generalized minimax functions
Preconditioner updates for solving sequences of linear systems in matrix-free environment
Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization
scientific article; zbMATH DE number 992821 (Why is no real title available?)
scientific article; zbMATH DE number 6118208 (Why is no real title available?)
scientific article; zbMATH DE number 4180681 (Why is no real title available?)
VE10
scientific article; zbMATH DE number 3843081 (Why is no real title available?)
scientific article; zbMATH DE number 3881771 (Why is no real title available?)
scientific article; zbMATH DE number 4199988 (Why is no real title available?)
A hybrid Hooke and Jeeves -- direct method for non-smooth optimization
Numerical methods for large-scale nonlinear optimization
LSA
Local Convergence of Secant Methods for Nonlinear Constrained Optimization
Local Convergence Theory of Inexact Newton Methods Based on Structured Least Change Updates
Primal interior-point method for large sparse minimax optimization

This page was built for software: ve08