Orthogonal Projections on Convex Sets for Newton-Like Methods

DOI10.1137/0722074zbMath0593.65044OpenAlexW2055226585MaRDI QIDQ3723613

S. M. Grzegórski

Publication date: 1985

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

unconstrained minimizationNewton-like methodsmethodsQ-superlinear convergencefixed least-change secant updatesmulti-level least-change secant updatesvariable-metric

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (6)

A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems ⋮ Local convergence of quasi-Newton methods under metric regularity ⋮ Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints ⋮ Multilevel least-change Newton-like methods for equality constrained optimization problems ⋮ A family of variable metric proximal methods ⋮ Local analysis of Newton-type methods for variational inequalities and nonlinear programming

This page was built for publication: Orthogonal Projections on Convex Sets for Newton-Like Methods