On the Convergence of Gradient Methods under Constraint
From MaRDI portal
Cited in
(18)- A least-distance programming procedure for minimization problems under linear constraints
- 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
- On the convergence of the projected gradient method
- A subgradient-based optimization for reservois system management
- Monotone variable-metric algorithm for linearly constrained nonlinear programming
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering
- An interior point algorithm for global optimal solutions and KKT points
- An active set method for solving linearly constrained nonsmooth optimization problems
- Optimisation connexe en dimension finie par relaxation
- Sur quelques méthodes de gradient réduit sous contraintes linéaires
- A nonlinear programming approach to a very large hydroelectric system optimization
- Sur la convergence théorique de la méthode du gradient reduit généralise
- A class of projected-search methods for bound-constrained optimization
- A super-linear convergent gradient projection type algorithm for linearly constrained problems
- Subgradient projection algorithm. II
This page was built for publication: On the Convergence of Gradient Methods under Constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5681822)
