Pages that link to "Item:Q2045187"
From MaRDI portal
The following pages link to The gradient projection algorithm for smooth sets and functions in nonconvex case (Q2045187):
Displaying 12 items.
- Maximization of a function with Lipschitz continuous gradient (Q267587) (← links)
- Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface (Q830954) (← links)
- The gradient projection method with Armijo's step size on manifolds (Q2059547) (← links)
- Stability of minimization problems and the error bound condition (Q2158835) (← links)
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity (Q2322369) (← links)
- Proximal gradient methods for general smooth graph total variation model in unsupervised learning (Q2674267) (← links)
- Two algorithms for finding the projection of a point onto a nonconvex set in a normed space (Q2840267) (← links)
- (Q4979615) (← links)
- Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization (Q5222248) (← links)
- (Q5269141) (← links)
- Conditions for linear convergence of the gradient method for non-convex optimization (Q6097482) (← links)
- The gradient projection method for a supporting function on the unit sphere and its applications (Q6552607) (← links)
