Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization

DOI10.1137/0803017zbMath0784.90075OpenAlexW2082760086MaRDI QIDQ5287107

Siyun Wang, Donald Goldfarb

Publication date: 11 August 1993

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0803017

zbMATH Keywords

superlinear convergencemodified Newton methodrank-one updates

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

Global convergence and the Powell singular function ⋮ Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities ⋮ An improved inexact Newton's method for unary optimization ⋮ High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms ⋮ Modified partial-update Newton-type algorithms for unary optimization ⋮ PCG-inexact Newton methods for unary optimization

Uses Software

• ve08

This page was built for publication: Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization