Efficiently Converging Minimization Methods Based on the Reduced Gradient

DOI10.1137/0314004MaRDI QIDQ4110806zbMATH OpenOpenAlexFDO

Authors Daniel Gabay, David G. Luenberger

Publication date 1976

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

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

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Numerical methods in optimal control (49Mxx) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cited in

(12)

• Minimizing a differentiable function over a differential manifold
• A computational method for minimization with nonlinear constraints
• An appreciation of Professor David G. Luenberger
• Variants of the reduced Newton method for nonlinear equality constrained optimization problems
• On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems
• Minimum problems on differentiable manifolds
• On the local and global convergence of a reduced Quasi-Newton method¹
• Une methode de gradient conjugue sur des varietes application a certains problemes de valeurs propres non lineaires
• Stochastic perturbation of reduced gradient \& GRG methods for nonconvex programming problems
• Two-phase generalized reduced gradient method for constrained global optimization
• Rayleigh quotient iteration, cubic convergence, and second covariant derivative
• Partial spectral projected gradient method with active-set strategy for linearly constrained optimization

This page was built for publication: Efficiently Converging Minimization Methods Based on the Reduced Gradient

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4110806)