On the Convergence of Gradient Methods under Constraint

DOI10.1147/rd.164.0407zbMath0265.90046OpenAlexW2075708987MaRDI QIDQ5681822

Philip Wolfe

Publication date: 1972

Published in: IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1147/rd.164.0407

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

A subgradient-based optimization for reservois system management, Sur la convergence théorique de la méthode du gradient reduit généralise, An active set method for solving linearly constrained nonsmooth optimization problems, A least-distance programming procedure for minimization problems under linear constraints, Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems, An interior point algorithm for global optimal solutions and KKT points, Optimisation connexe en dimension finie par relaxation, Generalized reduced gradient method as an extension of feasible direction methods, Minimization methods with constraints, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, A super-linear convergent gradient projection type algorithm for linearly constrained problems, Sur quelques méthodes de gradient réduit sous contraintes linéaires, Monotone variable-metric algorithm for linearly constrained nonlinear programming, Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering, Subgradient projection algorithm. II, A nonlinear programming approach to a very large hydroelectric system optimization, On the convergence of the projected gradient method