Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems

DOI10.1137/0318050zbMath0445.90098OpenAlexW2068943497MaRDI QIDQ3890450

No author found.

Publication date: 1980

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

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

zbMATH Keywords

Newton's methodreal Banach spaceconstrained minimization problemslocal convergence theoremrelaxed Newton methodglobal convergence theoremsGoldstein step-length rulelocal quadratic approximationsNewton-Goldstein algorithmproblems with singular critical pointstwice Frechet differentiable objective function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Normed linear spaces and Banach spaces; Banach lattices (46B99) Programming in abstract spaces (90C48)

Related Items (18)

A projected Newton method for minimization problems with nonlinear inequality constraints ⋮ Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities ⋮ Superlinear convergence of a trust region type successive linear programming method ⋮ Convergence of algorithms for perturbed optimization problems ⋮ An Extension of the Projected Gradient Method to a Banach Space Setting with Application in Structural Topology Optimization ⋮ An algorithm for discrete linear \(L_ p\) approximation ⋮ The modified barrier function method for linear programming and its extensions ⋮ On Regularization and Active-set Methods with Complexity for Constrained Optimization ⋮ PNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained Optimization ⋮ Solving variational inequality and fixed point problems by line searches and potential optimization ⋮ Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions ⋮ On the convergence of projected gradient processes to singular critical points ⋮ Extremal types for certain \(L^ p \)minimization problems and associated large scale nonlinear programs ⋮ A class of superlinearly convergent projection algorithms with relaxed stepsizes ⋮ Newton's method for singular constrained optimization problems ⋮ Convergent stepsizes for constrained optimization algorithms ⋮ Rates of convergence for adaptive Newton methods ⋮ Finite convergence of algorithms for nonlinear programs and variational inequalities

This page was built for publication: Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems