ve08 - MaRDI portal

Cited in

(only showing first 100 items - show all)

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
Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
A partitioned PSB method for partially separable unconstrained optimization problems
Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
scientific article; zbMATH DE number 3982416 (Why is no real title available?)
A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems
The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
An H-form variant of the partitioned QN method
A Class of Trust Region Methods for Nonlinear Network Optimization Problems
scientific article; zbMATH DE number 18298 (Why is no real title available?)
Unconstrained duals to partially separable constrained programs
On large scale nonlinear network optimization
Approximating Hessians in unconstrained optimization arising from discretized problems
Difference Newton-like methods under weak continuity conditions
A conjugate directions approach to improve the limited-memory BFGS method
scientific article; zbMATH DE number 4180681 (Why is no real title available?)
The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions
A rank-one fitting method for solving symmetric nonlinear equations
scientific article; zbMATH DE number 4199988 (Why is no real title available?)
On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
scientific article; zbMATH DE number 3843081 (Why is no real title available?)
Stable factorized quasi-Newton methods for nonlinear least-squares problems
Computing the sparsity pattern of Hessians using automatic differentiation
Global convergence of a class of collinear scaling algorithms with inexact line searches on convex functions
Nonlinear model predictive control via feasibility-perturbed sequential quadratic programming
The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization
On Large Scale Nonlinear Least Squares Calculations
scientific article; zbMATH DE number 778135 (Why is no real title available?)
Analysis of sparse quasi-Newton updates with positive definite matrix completion
A trust-region-based BFGS method with line search technique for symmetric nonlinear equations
On the Relation between Two Local Convergence Theories of Least-Change Secant Update Methods
scientific article; zbMATH DE number 872679 (Why is no real title available?)
scientific article; zbMATH DE number 3919686 (Why is no real title available?)
Sparse quasi-Newton updates with positive definite matrix completion
Nonlinear (local) optimization. The state of the art
Corrected sequential linear programming for sparse minimax optimization
Reformulations for utilizing separability when solving convex MINLP problems
A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares
Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization
scientific article; zbMATH DE number 6118208 (Why is no real title available?)
Local Convergence of Secant Methods for Nonlinear Constrained Optimization
Separation process optimization calculations
Inexact Secant Methods for Nonlinear Constrained Optimization
Local Convergence Theory of Inexact Newton Methods Based on Structured Least Change Updates
The global convergence of a modified BFGS method for nonconvex functions
Exploiting problem structure in pattern search methods for unconstrained optimization
Partitioned quasi-Newton methods for sparse nonlinear equations
A Quasi-Newton Method for Elliptic Boundary Value Problems
Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
A parallel quasi-Newton algorithm for unconstrained optimization
On the Impact of Automatic Differentiation on the Relative Performance of Parallel Truncated Newton and Variable Metric Algorithms
A family of the local convergence of the improved secant methods for nonlinear equality constrained optimization subject to bounds on variables
Learning general sparse additive models from point queries in high dimensions
The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden
Trust-region interior-point method for large sparsel₁optimization
Survey of trust-region derivative free optimization methods
Optimizing partially separable functions without derivatives
An implementation of Newton-like methods on nonlinearly constrained networks
An Optimal Positive Definite Update for Sparse Hessian Matrices
Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods
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

This page was built for software: ve08