The Gradient Projection Method Along Geodesics

DOI10.1287/mnsc.18.11.620zbMath0253.90050MaRDI QIDQ5668622

David G. Luenberger

Publication date: 1972

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.18.11.620

Mathematics Subject Classification ID

90C30: Nonlinear programming

90C99: Mathematical programming

Related Items

Nonlinear optimal feedback control for lunar module soft landing, A class of primal affine scaling algorithms, Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background, Convergence analysis of a global optimization algorithm using stochastic differential equations, Linearly constrained global optimization and stochastic differential equations, Geodesic convexity in nonlinear optimization, Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization, Global optimization of robust chance constrained problems, Conjugate gradient algorithm for optimization under unitary matrix constraint, Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis, Minimizing a differentiable function over a differential manifold, On the Pironneau-Polak method of centers, Minimization methods with constraints, Nonlinear coordinate representations of smooth optimization problems, A combined penalty function and gradient projection method for nonlinear programming, On the Second-Order Sufficiency Conditions, Minimum problems on differentiable manifolds